Uniquely colorable perfect graphs

DOI10.1016/0012-365X(83)90059-6zbMath0508.05037MaRDI QIDQ1837699

Alan C. Tucker

Publication date: 1983

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

zbMATH Keywords

strong perfect graph conjecturesequential coloringstrongly sequentially colorable graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Elementary bipartite graphs and unique colourability ⋮ A reduction procedure for coloring perfect \(K_ 4\)-free graphs ⋮ On a conjecture about uniquely colorable perfect graphs ⋮ On ideal clutters, metrics and multiflows ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution

Cites Work

• A characterization of perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• Perfect zero–one matrices
• On the strong perfect graph conjecture
• Unnamed Item

This page was built for publication: Uniquely colorable perfect graphs