Uniquely colorable perfect graphs

DOI10.1016/0012-365X(83)90059-6MaRDI QIDQ1837699zbMATH OpenFDO

Authors Alan C. Tucker

Publication date 1983

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(83)90059-6

zbMATH Keywords

sequential coloringstrong perfect graph conjecturestrongly sequentially colorable graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites work

• A characterization of perfect graphs
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• Normal hypergraphs and the perfect graph conjecture
• On the strong perfect graph conjecture
• Perfect zero–one matrices

Cited in

(5)

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

This page was built for publication: Uniquely colorable perfect graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1837699)