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

MaRDI QIDQ528972zbMATH OpenFDO

Authors 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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

chromatic numberdigraphgirthacyclic homomorphism

Mathematics Subject Classification ID

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

Recommendations

• A short construction of highly chromatic digraphs without short cycles
• Uniquely \(D\)-colourable digraphs with large girth
• Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization
• Two results on the digraph chromatic number
• scientific article; zbMATH DE number 927067

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3465328 (Why is no real title available?)
• scientific article; zbMATH DE number 1309148 (Why is no real title available?)
• scientific article; zbMATH DE number 1498519 (Why is no real title available?)
• scientific article; zbMATH DE number 3405977 (Why is no real title available?)
• A hypergraph-free construction of highly chromatic graphs without short cycles
• A short construction of highly chromatic digraphs without short cycles
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• On chromatic number of finite set-systems
• Strengthened Brooks' theorem for digraphs of girth at least three
• Sur le coloriage des graphs
• The circular chromatic number of a digraph
• The dichromatic number of a digraph
• Uniquely \(D\)-colourable digraphs with large girth

Cited in

(9)

• Uniquely \(D\)-colourable digraphs with large girth
• On random digraphs and cores
• Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization
• Results on uniquely colorable digraphs
• On colouring oriented graphs of large girth
• A short construction of highly chromatic digraphs without short cycles
• Construction of uniquely vertex k-colorable graphs with minimum possible size
• Constructions of 3-Colorable Cores
• Uniquely colourable m-dichromatic oriented graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528972)