A map colour theorem for the union of graphs

DOI10.1016/J.JCTB.2005.06.003MaRDI QIDQ2581497zbMATH OpenOpenAlexFDO

Authors Michael Stiebitz, Riste Škrekovski

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

Chromatic numberGraph decompositionHeawood numbersurface embedding

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1751599
• A ``nice map colour theorem
• On colorings of maps
• Reformulating the map color theorem
• scientific article; zbMATH DE number 3924805
• On the join of graphs and chromatic uniqueness
• On a theorem about vertex colorings of graphs
• A Vizing-like theorem for union vertex-distinguishing edge coloring
• scientific article; zbMATH DE number 1052826
• scientific article; zbMATH DE number 95245

Cites work

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

Cited in

(10)

• On the connectivity of graphs embedded in surfaces
• A possibly infinite series of surfaces with known 1-chromatic number
• Nordhaus-Gaddum-type theorem for diameter of graphs when decomposing into many parts
• On a Heawood-type problem for maps with tangencies
• scientific article; zbMATH DE number 4181300 (Why is no real title available?)
• The Other Map Coloring Theorem
• scientific article; zbMATH DE number 1751599 (Why is no real title available?)
• k-chromatic number of graphs on surfaces
• 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

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

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