Leveque, BenjaminMaffray, FredericPreissmann, Myriam2010-11-302010-11-302010-11-30200910.1002/jgt.20407https://infoscience.epfl.ch/handle/20.500.14299/59606WOS:000271918800006A path graph is the intersection graph of subpaths of a tree. In 1970, Renz asked for a characterization of path graphs by forbidden induced subgraphs. We answer this question by determining the complete list of graphs that are not path graphs and are minimal with this property. (C) 2009 Wiley Periodicals, Inc. J Graph Theory 62: 369-384, 2009intersection graphspath graphsforbidden induced subgraphsIntersection GraphsInterval-GraphsRecognitionAlgorithmsTreeCharacterizing Path Graphs by Forbidden Induced Subgraphstext::journal::journal article::research article