On uniquely 3-colorable graphs

DOI10.1016/0012-365X(93)90220-NzbMath0780.05021MaRDI QIDQ1210549

Chong-Yun Chao, Zhibo Chen

Publication date: 30 August 1993

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

zbMATH Keywords

regular graphsuniquely 3-colourable graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Unnamed Item, A critically chromatic graph, A bibliography on chromatic polynomials, Uniquely colorable graphs up to automorphisms, Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz, Algebraic characterization of uniquely vertex colorable graphs, A relation between choosability and uniquely list colorability, Construction of uniquely vertex k-colorable graphs with minimum possible size, On uniquely \(3\)-colorable graphs. II, Defining sets and uniqueness in graph colorings: A survey, \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges

Cites Work

• Parallel concepts in graph theory
• An introduction to chromatic polynomials
• Uniquely colorable graphs