A map colour theorem for the union of graphs

DOI10.1016/j.jctb.2005.06.003zbMath1098.05034OpenAlexW2001219652MaRDI QIDQ2581497

Riste Škrekovski, Michael Stiebitz

Publication date: 10 January 2006

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2005.06.003

zbMATH Keywords

Graph decompositionsurface embeddingChromatic numberHeawood number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

NORDHAUS–GADDUM-TYPE THEOREM FOR DIAMETER OF GRAPHS WHEN DECOMPOSING INTO MANY PARTS ⋮ Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts ⋮ Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• List colourings of planar graphs
• Five-coloring graphs on the torus
• Every planar graph is 5-choosable
• Note on the colouring of graphs
• On Complementary Graphs
• Map Colour Theorems Related To the Heawood Colour Formula
• A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
• Short Proof of a Map-Colour Theorem
• A list version of Dirac's theorem on the number of edges in colour-critical graphs
• Blocks and the nonorientable genus of graphs
• Dirac's map-color theorem for choosability
• Additivity of the genus of a graph
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• Nordhaus–Gaddum‐type Theorems for decompositions into many parts

This page was built for publication: A map colour theorem for the union of graphs