scientific article; zbMATH DE number 1743831
Heawood's theorem states that a triangulation of the plane is 3-chromatic if and only if the degree of each vertex is even. This paper offers extensions of Heawood's theorem in two directions: to nearly triangulations of the plane, and a 4-color analogue for triangulations of other surfaces. In the planar case, the author shows that a 2-connected plane graph is 3-chromatic if and only if it is locally 3-colorable given that no vertex lies on more than one face of size at least 4. In the nonplanar case, the author presents a result that if every noncontractible cycle is sufficiently long, then a surface triangulation is 4-colorable. No such 3-color theorem is possible.
- Complementary colorings
- A ``nice map colour theorem
- Three moves on signed surface triangulations
- Colouring Eulerian triangulations
- Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs
- Coloring near-quadrangulations of the cylinder and the torus
- 5-chromatic even triangulations on surfaces
- The singular edge set of a 4-coloring
- Cyclic 4-colorings of graphs on surfaces
- scientific article; zbMATH DE number 519832 (Why is no real title available?)
- scientific article; zbMATH DE number 1123793 (Why is no real title available?)
- Extending triangulations of the 2-sphere to the 3-disk preserving a 4-coloring
- 4-Colored Triangulation of 3-Maps
- Extension to 3-colorable triangulations
- Mod 3 arithmetic on triangulated Riemann surfaces
- 3-regular maps on closed surfaces are nearly distinguishing 3-colorable with few exceptions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4529309)