Two-colourings that decompose perfect graphs

DOI10.1016/0095-8956(90)90061-4zbMath0721.05019OpenAlexW2032344445MaRDI QIDQ2640608

William J. Lenhart, Vašek Chvátal, Najiba Sbihi

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0095-8956(90)90061-4

zbMATH Keywords

perfect graphsgraph decomposition

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Building counterexamples ⋮ A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames ⋮ Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames ⋮ Bichromatic \(P_{4}\)-composition schemes for perfect orderability

Cites Work

• Unnamed Item
• A new property of critical imperfect graphs and some consequences
• Star-cutsets and perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• On a property of the class of n-colorable graphs
• A note on even pairs

This page was built for publication: Two-colourings that decompose perfect graphs