Hajós and Ore constructions for digraphs
From MaRDI portal
Publication:2309234
DOI10.37236/8942zbMath1435.05088arXiv1908.04096OpenAlexW3012240360MaRDI QIDQ2309234
Michael Stiebitz, Thomas Bellitto, Thomas Schweser, Jörgen Bang-Jensen
Publication date: 30 March 2020
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.04096
Related Items (7)
On the dichromatic number of surfaces ⋮ Digraphs and Variable Degeneracy ⋮ The minimum number of edges in 4-critical digraphs of given order ⋮ The smallest 5-chromatic tournament ⋮ Four proofs of the directed Brooks' theorem ⋮ Various bounds on the minimum number of arcs in a \(k\)-dicritical digraph ⋮ Point partition numbers: perfect graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Grassmann homomorphism and Hajós-type theorems
- The edge density of critical digraphs
- Strengthened Brooks' theorem for digraphs of girth at least three
- The strong perfect graph theorem
- Eigenvalues and colorings of digraphs
- The 3 and 4-dichromatic tournaments of minimum order
- Critical graphs with connected complements
- The dichromatic number of a digraph
- Hajós' theorem for list coloring
- A Hajós-like theorem for list coloring
- Hajós-like theorem for signed graphs
- Hajós theorem for colorings of edge-weighted graphs
- A decomposition theorem for partially ordered sets
- Note on the colouring of graphs
- Gallai's Theorem for List Coloring of Digraphs
- Some Colouring Problems and their Complexity
- The Homomorphism Structure of Classes of Graphs
- Chromatic neighborhood sets
- [https://portal.mardi4nfdi.de/wiki/Publication:4376497 The graph constructions ofHaj�s and Ore]
- The Complexity of the Hajós Calculus
- Perfect Digraphs
- Planar Digraphs of Digirth Four are 2-Colorable
- Digraphs
This page was built for publication: Hajós and Ore constructions for digraphs
