Characterizing path graphs by forbidden induced subgraphs

Details Characterizing path graphs by forbidden induced subgraphs Characterizing path graphs by forbidden induced subgraphs

2008-03-06

arxiv.org/abs/0803.0956v3

Computer Science

Discrete Mathematics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Characterizing path graphs by forbidden induced subgraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Characterizing path graphs by forbidden induced subgraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Characterizing path graphs by forbidden induced subgraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-14558