On the dichromatic number of surfaces

DOI10.1007/978-3-030-83823-2_29MaRDI QIDQ6604692

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

Publication date: 13 September 2024

zbMATH Keywords

planar graphsgraphs on surfacesdichromatic number

Mathematics Subject Classification ID

Could not fetch data.

Cites Work

• Every planar map is four colorable. I: Discharging
• The 3 and 4-dichromatic tournaments of minimum order
• Map-colour theorem.
• 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
• Gallai's Theorem for List Coloring of Digraphs
• A Six Color Problem
• Planar Digraphs of Digirth Four are 2-Colorable
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604692)