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 the operation of 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.
机构:
Rhodes Univ, Dept Math Pure & Appl, POB 94, ZA-6140 Grahamstown, South AfricaRhodes Univ, Dept Math Pure & Appl, POB 94, ZA-6140 Grahamstown, South Africa
Andriantiana, Eric O. D.
Dossou-Olory, Audace A. V.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Johannesburg, Dept Math & Appl Math, POB 524,Auckland Pk, ZA-2006 Johannesburg, South AfricaRhodes Univ, Dept Math Pure & Appl, POB 94, ZA-6140 Grahamstown, South Africa