scientific article; zbMATH DE number 1743831

From MaRDI portal
Publication:4529309





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.











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)