Uniquely Colourable Graphs with Large Girth
From MaRDI portal
Publication:4111592
DOI10.4153/CJM-1976-133-5zbMath0344.05115MaRDI QIDQ4111592
Béla Bollobás, Norbert W. Sauer
Publication date: 1976
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
05C15: Coloring of graphs and hypergraphs
Related Items
Generalized chromatic numbers of random graphs, Degree sequences of random graphs, Critically partitionable graphs. II, Defining sets and uniqueness in graph colorings: A survey, Extremal results on defective colorings of graphs, The existence of uniquely \(-G\) colourable graphs, On some conjectures of Graffiti, On sparse graphs with given colorings and homomorphisms., \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges, A relation between choosability and uniquely list colorability, Star chromatic numbers of graphs, A novel giant-subgraph phase-transition in sparse random \(k\)-partite graphs, On the chromatic number of the product of graphs, An approach to hedetniemi's conjecture, ON UNIQUELY -G k-COLOURABLE GRAPHS