A seven-color theorem on the sphere

DOI10.1016/0012-365X(73)90142-8MaRDI QIDQ2558864zbMATH OpenFDO

Authors H. V. Kronk, John Mitchem

Publication date 1973

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(73)90142-8

Mathematics Subject Classification ID

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

Cites work

• Ein Sechsfarbenproblem auf der Kugel
• scientific article; zbMATH DE number 3257171 (Why is no real title available?)
• scientific article; zbMATH DE number 3288507 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• On the Colourings of Graphs
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• The chromatic class and the location of a graph on a closed surface
• The Colour Numbers of Complete Graphs

Cited in

(24)

• Entire choosability of near-outerplane graphs
• Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
• Simultaneous coloring of edges and faces of plane graphs
• Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
• On the complete chromatic number of Halin graphs
• Entire coloring of graphs embedded in a surface of nonnegative characteristic
• A six-color theorem for the edge-face coloring of plane graphs
• On the colorings of outerplanar graphs
• Plane graphs with \(\Delta = 7\) are entirely 10-colorable
• Joint extension of two theorems of Kotzig on 3-polytopes
• The entire chromatic number of graphs embedded on the torus with large maximum degree
• The entire coloring of series-parallel graphs
• Plane graphs with maximum degree 9 are entirely 11-choosable
• Entire \((\varDelta +2)\)-colorability of plane graphs
• The entire choosability of plane graphs
• Entire coloring of 2-connected plane graphs
• scientific article; zbMATH DE number 4212106 (Why is no real title available?)
• A note on entire choosability of plane graphs
• Plane graphs with maximum degree 8 are entirely ( +3)-colorable
• Simultaneous coloring of vertices and incidences of outerplanar graphs
• Entire colouring of plane graphs
• Facial entire coloring of K₄-minor-free graphs
• Entire coloring of plane graph with maximum degree eleven
• Facial entire colouring of plane graphs

This page was built for publication: A seven-color theorem on the sphere

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