scientific article; zbMATH DE number 4039932

From MaRDI portal
Publication:3778779





[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.












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 Q3778779)