On a conjecture about uniquely colorable perfect graphs

DOI10.1016/S0012-365X(96)00353-6zbMath0885.05061WikidataQ123314134 ScholiaQ123314134MaRDI QIDQ1377674

Gábor Bacsó

Publication date: 24 March 1998

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

zbMATH Keywords

claw-free graphperfect graphclique-pairclique-pair conjectureuniquely colorable graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Elementary bipartite graphs and unique colourability ⋮ Integral-root polynomials and chromatic uniqueness of graphs ⋮ Chromatic uniqueness of zero-divisor graphs

Cites Work

• Topics on perfect graphs
• On conjecture of Berge
• Recognizing claw-free perfect graphs
• Star-cutsets and perfect graphs
• Coloring graphs with stable cutsets
• Dominating cliques in \(P_ 5\)-free graphs
• Uniquely colorable perfect graphs
• A characterization of perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• Perfect zero–one matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item