Forbidden induced subgraphs of double-split graphs

From MaRDI portal
Publication:2902883

DOI10.1137/100818121zbMATH Open1245.05054arXiv1012.3680OpenAlexW3106397760MaRDI QIDQ2902883FDOQ2902883


Authors: Boris Alexeev, Ilhee Kim, Alexandra Fradkin Edit this on Wikidata


Publication date: 22 August 2012

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1012.3680




Recommendations





Cited In (8)





This page was built for publication: Forbidden induced subgraphs of double-split graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2902883)