Uniquely D-colourable Digraphs with Large Girth

DOI10.4153/CJM-2011-084-9zbMath1254.05057arXiv1109.5208OpenAlexW1999197342MaRDI QIDQ3143310

Bojan Mohar, Liam Rafferty, P. Mark Kayll, Ararat Harutyunyan

Publication date: 29 November 2012

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

Full work available at URL: https://arxiv.org/abs/1109.5208

zbMATH Keywords

uniquely circularly \(r\)-colourable digraphs\(C\)-colouring

Mathematics Subject Classification ID

Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Subgraphs of Kneser graphs with large girth and large chromatic number ⋮ Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization ⋮ Unnamed Item ⋮ A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth ⋮ Extension of Gyárfás-Sumner conjecture to digraphs ⋮ On the Complexity of Digraph Colourings and Vertex Arboricity

This page was built for publication: Uniquely D-colourable Digraphs with Large Girth