Building counterexamples
From MaRDI portal
Publication:1363703
DOI10.1016/S0012-365X(96)00081-7zbMath0874.05024WikidataQ56430121 ScholiaQ56430121MaRDI QIDQ1363703
Publication date: 22 October 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Quasi-parity and perfect graphs ⋮ Path parity and perfection ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution
Cites Work
- Counterexamples to three conjectures concerning perfect graphs
- Coloring perfect \((K_ 4\)-e)-free graphs
- A semi-strong perfect graph theorem
- A new property of critical imperfect graphs and some consequences
- Star-cutsets and perfect graphs
- Coloring graphs with stable cutsets
- Compositions for perfect graphs
- A characterization of perfect graphs
- Two-colourings that decompose perfect graphs
