Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs

DOI10.1016/S0095-8956(02)00021-7zbMath1030.05049MaRDI QIDQ1405122

Michele Conforti, Cornuéjols, Gérard

Publication date: 25 August 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

Perfect graph2-joinDecompositionMeyniel graphStrong perfect graph conjectureLine graph of bipartite graphOdd holeStar cutset

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Perfect graphs (05C17)

Related Items

Hereditary Efficiently Dominatable Graphs, Graphs of separability at most 2, On graphs with no induced subdivision of \(K_4\), Square-free perfect graphs., Graphs of Separability at Most Two: Structural Characterizations and Their Consequences, Decomposition of odd-hole-free graphs by double star cutsets and 2-joins, The strong perfect graph conjecture: 40 years of attempts, and its resolution

Cites Work

• Unnamed Item
• Perfect graphs, partitionable graphs and cutsets
• The strong perfect graph theorem
• Star-cutsets and perfect graphs
• Alpha-balanced graphs and matrices and GF(3)-representability of matroids
• On the perfect graph conjecture
• A description of claw-free perfect graphs
• A theorem of Truemper
• Compositions for perfect graphs
• A Combinatorial Decomposition Theory
• Even and odd holes in cap-free graphs
• A mickey-mouse decomposition theorem