On colouring oriented graphs of large girth

MaRDI QIDQ6183284zbMATH OpenFDO

Authors

Publication date 26 January 2024

Full work available at URL https://arxiv.org/abs/2307.09461, https://cdm.ucalgary.ca/article/view/73457

zbMATH Keywords

girthhomomorphismsoriented chromatic numberoriented graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Combinatorial probability (60C05)

Recommendations

• Colorings and girth of oriented planar graphs
• An oriented coloring of planar graphs with girth at least five
• An oriented colouring of planar graphs with girth at least 4
• Oriented 5-coloring of sparse plane graphs
• An oriented 7-colouring of planar graphs with girth at least 7

Cites work

• A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth
• A hypergraph-free construction of highly chromatic graphs without short cycles
• Graph theory
• Graph Theory and Probability
• scientific article; zbMATH DE number 927067 (Why is no real title available?)
• On chromatic number of finite set-systems
• On sparse graphs with given colorings and homomorphisms.
• The circular chromatic number of a digraph
• Uniquely D-colourable digraphs with large girth
• Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization
• Uniquely Colourable Graphs with Large Girth

This page was built for publication: On colouring oriented graphs of large girth

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