Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization

DOI10.37236/9689zbMath1459.05081arXiv2007.01981OpenAlexW3138790773MaRDI QIDQ2656903

Esmaeil Parsa, P. Mark Kayll

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

zbMATH Keywords

\(D\)-colouringuniquely circularly \(r\)-colourable digraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Uniquely colorable graphs up to automorphisms ⋮ Unnamed Item

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