Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization
From MaRDI portal
Publication:2656903
DOI10.37236/9689zbMath1459.05081arXiv2007.01981OpenAlexW3138790773MaRDI QIDQ2656903
Publication date: 17 March 2021
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.01981
Related Items (2)
Cites Work
- Coloring, sparseness and girth
- A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth
- A hypergraph-free construction of highly chromatic graphs without short cycles
- On colorings of graphs without short cycles
- On sparse graphs with given colorings and homomorphisms.
- Uniquely D-colourable Digraphs with Large Girth
- Graph Theory and Probability
- Uniquely Colourable Graphs with Large Girth
- The circular chromatic number of a digraph
- Digraphs
- On chromatic number of finite set-systems
- Graph colouring and the probabilistic method
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization