No label defined (Q3778779)

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 4039932
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4039932

      Statements

      0 references
      1985
      0 references
      triangulation
      0 references
      four colour problem
      0 references
      4-colourings
      0 references
      mono-diagonalization
      0 references
      bi-diagonalizations
      0 references
      survey
      0 references
      [For the entire collection see Zbl 0548.00012.] A triangulation T of the sphere without 2-cycles and without separating 3-cycles has a Hamiltonian cycle C by a well-known theorem of \textit{H. Whitney} [Ann. Math., II. Ser. 32, 378-390 (1931; Zbl 0002.16101)]. Thus T consists of two triangulations of the cycle C (the inside of C and the outside) and is called a bidiagonalization (consisting of two mono- diagonalizations). The four colour problem may be formulated as the question if two sets, each consisting of the restrictions to a cycle C of all 4-colourings of a mono-diagonalization of C, always have non-empty intersection. The present paper presents a survey of mono- and bi- diagonalizations, their chromatic properties, and how to represent and generate their colourings using trees. In particular results of the author, H. Heesch and Th. Kaluza are mentioned. The survey includes some proofs.
      0 references

      Identifiers