About skew partitions in minimal imperfect graphs

DOI10.1006/jctb.2001.2044zbMath1028.05036OpenAlexW2005264047MaRDI QIDQ1850559

Yanyan Li

Publication date: 10 December 2002

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

Full work available at URL: https://semanticscholar.org/paper/93b4eda093e22049e6ba18adcafbca76ac9b4848

zbMATH Keywords

stable setskew cutset

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)

Related Items

Stable skew partition problem ⋮ Colouring perfect graphs with bounded clique number ⋮ Three-colourable perfect graphs without even pairs ⋮ Even pairs and prism corners in square-free Berge graphs ⋮ On Roussel-Rubio-type lemmas and their consequences ⋮ Skew partitions in perfect graphs ⋮ Even pairs in Berge graphs ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution ⋮ A class of perfectly contractile graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new property of critical imperfect graphs and some consequences
• Star-cutsets and perfect graphs
• Some properties of minimal imperfect graphs
• Complete multi-partite cutsets in minimal imperfect graphs
• A characterization of perfect graphs
• Transformations which Preserve Perfectness and H-Perfectness of Graphs
• Perfect zero–one matrices