No label defined (Q4529309)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1743831
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1743831

      Statements

      0 references
      25 August 2002
      0 references
      coloring
      0 references
      surface triangulation
      0 references
      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.
      0 references

      Identifiers