Digraph Girth via Chromatic Number

DOI10.1137/120875892zbMath1272.05065OpenAlexW2035128192MaRDI QIDQ2848530

Zhentao Li, Bojan Mohar, Peter Keevash, Bruce A. 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

cyclesgraph coloringdirected graphs

Mathematics Subject Classification ID

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

Related Items (5)

The \(m\)-degenerate chromatic number of a digraph ⋮ Colourings, homomorphisms, and partitions of transitive digraphs ⋮ Coloring digraphs with forbidden cycles ⋮ Acyclic subgraphs of planar digraphs ⋮ Coloring tournaments: from local to global

This page was built for publication: Digraph Girth via Chromatic Number