A construction of uniquely n-colorable digraphs with arbitrarily large digirth
zbMATH Open1361.05060MaRDI QIDQ528972FDOQ528972
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
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
Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Sur le coloriage des graphs
- The circular chromatic number of a digraph
- Title not available (Why is that?)
- Strengthened Brooks' theorem for digraphs of girth at least three
- The dichromatic number of a digraph
- On chromatic number of finite set-systems
- A hypergraph-free construction of highly chromatic graphs without short cycles
- Title not available (Why is that?)
- A short proof of the existence of highly chromatic hypergraphs without short cycles
- Title not available (Why is that?)
- Uniquely \(D\)-colourable digraphs with large girth
- Title not available (Why is that?)
- A short construction of highly chromatic digraphs without short cycles
Cited In (9)
- Uniquely colourable m-dichromatic oriented graphs
- Uniquely \(D\)-colourable digraphs with large girth
- A short construction of highly chromatic digraphs without short cycles
- Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization
- Results on uniquely colorable digraphs
- On colouring oriented graphs of large girth
- Constructions of 3-Colorable Cores
- Construction of uniquely vertex k-colorable graphs with minimum possible size
- On random digraphs and cores
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)
