Reformulating the map color theorem

DOI10.1016/J.DISC.2004.07.031MaRDI QIDQ2575792zbMATH OpenOpenAlexWikidataFDO

Authors Louis Kauffman

Publication date 6 December 2005

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0112266

zbMATH Keywords

coloring plane mapsPenrose formula

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Abstract: This paper discusses reformulations of the problem of coloring plane maps with four colors. The context is the edge-coloring with three colors of cubic graphs such that three distinct colors occur at each vertex. We include discussion of the Eliahou-Kryuchkov conjecture, the Penrose formula, the vector cross product formulation and the reformulations in terms of formations and factorizations due to G. Spencer-Brown. The latter includes a proof of the Spencer-Brown parity lemma and discussion of the parity-pass algorithm.

Recommendations

• A state calculus for graph coloring
• Four color theorem from three points of view
• On the map theorem
• One More Probabilistic Reformulation of the Four Colour Conjecture
• Some arithmetical restatements of the four color conjecture

Cites work

• scientific article; zbMATH DE number 3344105 (Why is no real title available?)
• Flips signés et triangulations d'un polygone. (Signed flips and triangulations of a polygon)
• Map coloring and the vector cross product
• On the Four-Colour Conjecture
• On the map theorem
• Signed diagonal flips and the four color theorem

Cited in

(13)

• scientific article; zbMATH DE number 1778086 (Why is no real title available?)
• On the map theorem
• A map colour theorem for the union of graphs
• Some arithmetical restatements of the four color conjecture
• Four color theorem from three points of view
• A state calculus for graph coloring
• Map coloring and the vector cross product
• scientific article; zbMATH DE number 1751599 (Why is no real title available?)
• Open problems in topology.
• Four colors do not suffice
• The Other Map Coloring Theorem
• Coloring planar graphs via colored paths in the associahedra
• On ribbon graphs and virtual links

This page was built for publication: Reformulating the map color theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2575792)