Forbidden induced subgraphs of double-split graphs

Details Forbidden induced subgraphs of double-split graphs Forbidden induced subgraphs of double-split graphs

2010-12-16

arxiv.org/abs/1012.3680v1

SIAM Journal on Discrete Mathematics 26 (2012), no. 1, 1-14

Mathematics

Combinatorics

16 pages, 2 figures

Scientific paper

10.1137/100818121

In the course of proving the strong perfect graph theorem, Chudnovsky, Robertson, Seymour, and Thomas showed that every perfect graph either belongs to one of five basic classes or admits one of several decompositions. Four of the basic classes are closed under taking induced subgraphs (and have known forbidden subgraph characterizations), while the fifth one, consisting of double-split graphs, is not. A graph is doubled if it is an induced subgraph of a double-split graph. We find the forbidden induced subgraph characterization of doubled graphs; it contains 44 graphs.

Affiliated with

Also associated with

No associations

Rating

Forbidden induced subgraphs of double-split graphs 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 Forbidden induced subgraphs of double-split graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Forbidden induced subgraphs of double-split graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-219964