Counterexamples to three conjectures concerning perfect graphs

DOI10.1016/0012-365X(93)90338-TzbMath0795.05059WikidataQ123252948 ScholiaQ123252948MaRDI QIDQ686172

Stefan Hougardy

Publication date: 11 September 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

chromatic numberstrong perfect graph conjectureBerge graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Quasi-parity and perfect graphs ⋮ Path parity and perfection ⋮ Building counterexamples ⋮ A recognition algorithm for simple-triangle graphs ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coloring perfect \((K_ 4\)-e)-free graphs
• Alternating orientation and alternating colouration of perfect graphs
• Perfectly orderable graphs are quasi-parity graphs: a short proof
• A semi-strong perfect graph theorem
• A new property of critical imperfect graphs and some consequences
• A fast algorithm for coloring Meyniel graphs
• Star-cutsets and perfect graphs
• Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)]
• A characterization of perfect graphs
• Transformations which Preserve Perfectness and H-Perfectness of Graphs

This page was built for publication: Counterexamples to three conjectures concerning perfect graphs