Characterizing path graphs by forbidden induced subgraphs

  • Authors:

  • Benjamin Lévêque;Frédéric Maffray;Myriam Preissmann

  • Affiliations:

  • Rose, EPFL, Lausanne, Switzerland;C.N.R.S., Laboratoire G-SCOP, Grenoble, France;C.N.R.S., Laboratoire G-SCOP, Grenoble, France

  • Venue:
  • Journal of Graph Theory
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

A 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. © 2009 Wiley Periodicals, Inc. J Graph Theory 62: 369–384, 2009