Uniquely Colourable Graphs with Large Girth

DOI10.4153/CJM-1976-133-5zbMath0344.05115OpenAlexW2317124256MaRDI QIDQ4111592

Béla Bollobás, Norbert W. Sauer

Publication date: 1976

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1976-133-5

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Subgraphs of Kneser graphs with large girth and large chromatic number, Triangle-free subgraphs with large fractional chromatic number, Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization, The existence of uniquely \(-G\) colourable graphs, On some conjectures of Graffiti, Dualities and dual pairs in Heyting algebras, An approach to hedetniemi's conjecture, ON UNIQUELY -G k-COLOURABLE GRAPHS, Degree sequences of random graphs, Uniquely colorable graphs up to automorphisms, Triangle-free subgraphs with large fractional chromatic number, On sparse graphs with given colorings and homomorphisms., On two generalizations of the Alon-Tarsi polynomial method, Critically partitionable graphs. II, Unnamed Item, On the chromatic number of the product of graphs, A construction of uniquely colourable graphs with equal colour class sizes, A relation between choosability and uniquely list colorability, Generalized chromatic numbers of random graphs, Star chromatic numbers of graphs, Defining sets and uniqueness in graph colorings: A survey, \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges, A novel giant-subgraph phase-transition in sparse random \(k\)-partite graphs, Extremal results on defective colorings of graphs