On a conjecture about uniquely colorable perfect graphs
From MaRDI portal
Publication:1377674
DOI10.1016/S0012-365X(96)00353-6zbMath0885.05061WikidataQ123314134 ScholiaQ123314134MaRDI QIDQ1377674
Publication date: 24 March 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
05C15: Coloring of graphs and hypergraphs
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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