Two results on the digraph chromatic number
From MaRDI portal
Publication:418896
DOI10.1016/j.disc.2012.01.028zbMath1242.05095arXiv1110.4898OpenAlexW2046546000MaRDI QIDQ418896
Ararat Harutyunyan, Bojan Mohar
Publication date: 30 May 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1110.4898
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items
The \(m\)-degenerate chromatic number of a digraph, The geometry of noncommutative space-time, Heroes in Orientations of Chordal Graphs, Bounds for the dichromatic number of a generalized lexicographic product of digraphs, Digraphs and Variable Degeneracy, Generalized DP-colorings of graphs, Four proofs of the directed Brooks' theorem, Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of \(P_4\), Heroes in oriented complete multipartite graphs, DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER, Coloring digraphs with forbidden cycles, The edge density of critical digraphs, Extension of Gyárfás-Sumner conjecture to digraphs, Acyclic subgraphs of planar digraphs, The star dichromatic number, Coloring tournaments: from local to global
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strengthened Brooks' theorem for digraphs of girth at least three
- On coloring graphs with locally small chromatic number
- Eigenvalues and colorings of digraphs
- Chromatic number, girth and maximal degree
- Packing directed circuits
- The dichromatic number of a digraph
- Small odd cycles in 4-chromatic graphs
- Gallai's Theorem for List Coloring of Digraphs
- On circuits and subgraphs of chromatic graphs
- Some extremal results in cochromatic and dichromatic theory
- Short odd cycles in 4-chromatic graphs
- Circular colorings of edge-weighted graphs
- The circular chromatic number of a digraph
