Digraph girth via chromatic number

DOI10.1137/120875892MaRDI QIDQ2848530zbMATH OpenOpenAlexFDO

Authors Peter Keevash, Zhentao Li, Bojan Mohar, Bruce Reed

Publication date 26 September 2013

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/ce503fa33f1af5143c9717af3eaebf0329991d8b

zbMATH Keywords

cyclesdirected graphsgraph coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Recommendations

• Two results on the digraph chromatic number
• A note on coloring digraphs of large girth
• Spectral radius of digraphs with given dichromatic number
• Strengthened Brooks' theorem for digraphs of girth at least three
• New Bounds for the Dichromatic Number of a Digraph

Cited in

(13)

• Circular coloring of planar digraphs
• On the girth of digraphs
• A note on generalized chromatic number and generalized girth
• A note on coloring digraphs of large girth
• Coloring tournaments: from local to global
• Acyclic subgraphs of planar digraphs
• The \(m\)-degenerate chromatic number of a digraph
• Colourings, homomorphisms, and partitions of transitive digraphs
• Two results on the digraph chromatic number
• Coloring digraphs with forbidden cycles
• The edge density of critical digraphs
• A short construction of highly chromatic digraphs without short cycles
• Strengthened Brooks' theorem for digraphs of girth at least three

This page was built for publication: Digraph girth via chromatic number

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