Coloring digraphs with forbidden cycles
From MaRDI portal
Publication:490994
DOI10.1016/j.jctb.2015.06.001zbMath1319.05050arXiv1403.8127OpenAlexW2124145403MaRDI QIDQ490994
Zhibin Chen, Wenan Zang, Jie Ma
Publication date: 21 August 2015
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.8127
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items
The \(m\)-degenerate chromatic number of a digraph, Cycles in color-critical graphs, A dichotomy theorem for circular colouring reconfiguration, Cycle lengths and minimum degree of graphs, Complete directed minors and chromatic number, Congruence of cycle lengths and chromatic number, Subdivisions with congruence constraints in digraphs of large chromatic number, A Strengthening on Odd Cycles in Graphs of Given Chromatic Number, Cycles and new bounds for the chromatic number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Problems on cycles and colorings
- Two results on the digraph chromatic number
- Strengthened Brooks' theorem for digraphs of girth at least three
- Graph coloring in linear time
- Graphs with \(k\) odd cycle lengths
- Cycles of length 0 modulo 4 in graphs
- The dichromatic number of a digraph
- Cycle lengths and chromatic number of graphs
- Tournaments and colouring
- Circumference, chromatic number and online coloring
- Digraph Girth via Chromatic Number
- Cycle length parities and the chromatic number
- Gallai's Theorem for List Coloring of Digraphs
- A bound on the chromatic number using the longest odd cycle length
- A Min-Max Theorem on Tournaments
- Diconnected Orientations and a Conjecture of Las Vergnas
- Circular colorings of edge-weighted graphs
- The circular chromatic number of a digraph
- On chromatic number of graphs and set-systems
- Nombre chromatique et plus longs chemins d'un graphe
