A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth

zbMath1361.05060MaRDI QIDQ528972

Michael Severino

Publication date: 18 May 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i2p1

zbMATH Keywords

digraphchromatic numbergirthacyclic homomorphism

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strengthened Brooks' theorem for digraphs of girth at least three
• A hypergraph-free construction of highly chromatic graphs without short cycles
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• The dichromatic number of a digraph
• Uniquely D-colourable Digraphs with Large Girth
• The circular chromatic number of a digraph
• On chromatic number of finite set-systems
• Sur le coloriage des graphs

This page was built for publication: A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth