A seven-color theorem on the sphere
From MaRDI portal
Publication:2558864
DOI10.1016/0012-365X(73)90142-8zbMath0256.05106MaRDI QIDQ2558864
Publication date: 1973
Published in: Discrete Mathematics (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
The entire choosability of plane graphs ⋮ Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces ⋮ Joint extension of two theorems of Kotzig on 3-polytopes ⋮ Plane graphs with maximum degree 9 are entirely 11-choosable ⋮ A six-color theorem for the edge-face coloring of plane graphs ⋮ Entire \((\varDelta +2)\)-colorability of plane graphs ⋮ On the complete chromatic number of Halin graphs ⋮ On the colorings of outerplanar graphs ⋮ The entire chromatic number of graphs embedded on the torus with large maximum degree ⋮ Plane Graphs with Maximum Degree Are Entirely ‐Colorable ⋮ Entire coloring of 2-connected plane graphs ⋮ Plane graphs with \(\Delta = 7\) are entirely 10-colorable ⋮ Simultaneous coloring of vertices and incidences of outerplanar graphs ⋮ Unnamed Item ⋮ Facial entire colouring of plane graphs ⋮ A note on entire choosability of plane graphs ⋮ Entire colouring of plane graphs ⋮ Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs ⋮ Entire coloring of graphs embedded in a surface of nonnegative characteristic ⋮ Entire coloring of plane graph with maximum degree eleven ⋮ Entire choosability of near-outerplane graphs ⋮ The entire coloring of series-parallel graphs ⋮ Simultaneous coloring of edges and faces of plane graphs
Cites Work
