On the dichromatic number of surfaces

DOI10.37236/10223zbMath1494.05042arXiv2102.01034OpenAlexW4213449832MaRDI QIDQ2121762

Clément Rambaud, Kolja Knauer, Pierre Aboulker, Frédéric Havet

Publication date: 4 April 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.01034

zbMATH Keywords

surface graphsdicolorability

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Four proofs of the directed Brooks' theorem

Uses Software

• nauty
• Traces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orientable and non orientable genus of the complete bipartite graph
• The non-existence of colorings
• Every planar map is four colorable. I: Discharging
• Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
• The 3 and 4-dichromatic tournaments of minimum order
• Color-critical graphs on a fixed surface
• On tournaments free of large transitive subtournaments
• Cuts in matchings of 3-connected cubic graphs
• The dichromatic number of a digraph
• The minimum number of edges in 4-critical digraphs of given order
• Hajós and Ore constructions for digraphs
• Practical graph isomorphism. II.
• Gallai's Theorem for List Coloring of Digraphs
• Map Colour Theorems Related to the Heawood Colour Formula (II)
• The Voting Problem
• Planar Formulae and Their Uses
• Some extremal results in cochromatic and dichromatic theory
• Coloring graphs with fixed genus and girth
• The circular chromatic number of a digraph
• List coloring digraphs
• Planar Digraphs of Digirth Four are 2-Colorable
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• An Analogue to the Heawood Map-Colouring Problem
• Disproof of a conjecture of Erdös and moser on tournaments
• A 4-Color Theorem for Toroidal Graphs
• Edge‐maximal graphs on orientable and some nonorientable surfaces

This page was built for publication: On the dichromatic number of surfaces