Uniquely Colourable Graphs with Large Girth
From MaRDI portal
Cited in
(25)- A construction of uniquely colourable graphs with equal colour class sizes
- \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges
- Uniquely colorable graphs up to automorphisms
- The existence of uniquely \(-G\) colourable graphs
- A novel giant-subgraph phase-transition in sparse random \(k\)-partite graphs
- Defining sets and uniqueness in graph colorings: A survey
- A relation between choosability and uniquely list colorability
- On the chromatic number of the product of graphs
- Extremal results on defective colorings of graphs
- On two generalizations of the Alon-Tarsi polynomial method
- Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization
- ON UNIQUELY -G k-COLOURABLE GRAPHS
- Dualities and dual pairs in Heyting algebras
- Generalized chromatic numbers of random graphs
- An approach to hedetniemi's conjecture
- Triangle-free subgraphs with large fractional chromatic number
- Critically partitionable graphs. II
- Star chromatic numbers of graphs
- Subgraphs of Kneser graphs with large girth and large chromatic number
- On colouring oriented graphs of large girth
- On sparse graphs with given colorings and homomorphisms.
- Triangle-free subgraphs with large fractional chromatic number
- Uniquely proper distinguishing colorable graphs
- Degree sequences of random graphs
- On some conjectures of Graffiti
This page was built for publication: Uniquely Colourable Graphs with Large Girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4111592)
