SIAM Digital Library
 
 
 

You are not logged in Logged Out Log In

SIAM J. on Discrete Mathematics / Volume 26 / Issue 1

SIAM J. Discrete Math. 26, pp. 1-14 (14 pages)

Forbidden Induced Subgraphs of Double-split Graphs

Boris Alexeev, Alexandra Fradkin, and Ilhee Kim

Full Text: Download PDF | Buy PDF (US$25) | View Cart
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.

© 2012 Society for Industrial and Applied Mathematics

RELATED DATABASES

To view database links for this article, you need to log in.

KEYWORDS

AMS Subject Headings

05C17

PUBLICATION DATA

ISSN

0895-4801 (print)  
1095-7146 (online)

Publisher

$abstract.society.value is a Member of CrossRef Society for Industrial and Applied Mathematics

ARTICLE DATA

History
Received December 14, 2010
Accepted August 03, 2011
Published online January 03, 2012
Digital Object Identifier
http://dx.doi.org/10.1137/100818121

For access to fully linked references, you need to log in.

Close

Your Recent History Recent History Help

Recently Viewed

  1. Forbidden Induced Subgraphs of Double-split Graphs
  2. Roman Domination on 2-Connected Graphs
  3. A Deterministic Algorithm for the Frieze–Kannan Regularity Lemma
  4. Griggs and Yeh's Conjecture and $L(p,1)$-labelings
  5. Testing Triangle-Freeness in General Graphs
© SIAM By using SIAM Publications Online you agree to abide by the Terms and Conditions of Use. Banner art adapted from a figure by Hinke M. Osinga and Bernd Krauskopf (University of Bristol, UK).
close