Building counterexamples

DOI10.1016/S0012-365X(96)00081-7MaRDI QIDQ1363703zbMATH OpenDBLPWikidataFDO

Authors Irena Rusu

Publication date 22 October 1997

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

perfect graphdiamond-freeeven pairstable cutsetminimal imperfect graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Counterexamples to three conjectures concerning perfect graphs
• A survey of the strong perfect graph conjecture and some recent results
• Publication:3487429
• The strong perfect graph conjecture holds for diamonded odd cycle-free graphs

Cites work

• A characterization of perfect graphs
• A new property of critical imperfect graphs and some consequences
• A semi-strong perfect graph theorem
• Coloring graphs with stable cutsets
• Coloring perfect \((K_ 4\)-e)-free graphs
• Compositions for perfect graphs
• Counterexamples to three conjectures concerning perfect graphs
• Star-cutsets and perfect graphs
• Two-colourings that decompose perfect graphs

Cited in

(4)

• Path parity and perfection
• Quasi-parity and perfect graphs
• Computer Aided Verification
• The strong perfect graph conjecture: 40 years of attempts, and its resolution

This page was built for publication: Building counterexamples

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