Characterizing path graphs by forbidden induced subgraphs
Discrete Mathematics
2008-12-18 v3
Abstract
A graph is a path graph if it is the intersection graph of a family of subpaths of a tree. In 1970, Renz asked for a characterizaton of path graphs by forbidden induced subgraphs. Here we answer this question by listing all graphs that are not path graphs and are minimal with this property.
Keywords
Cite
@article{arxiv.0803.0956,
title = {Characterizing path graphs by forbidden induced subgraphs},
author = {Benjamin Lévêque and Frédéric Maffray and Myriam Preissmann},
journal= {arXiv preprint arXiv:0803.0956},
year = {2008}
}