Reformulating the map color theorem
From MaRDI portal
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
Cites work
- Flips signés et triangulations d'un polygone. (Signed flips and triangulations of a polygon)
- scientific article; zbMATH DE number 3344105 (Why is no real title available?)
- 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
(16)- Map coloring and the vector cross product
- Open problems in topology.
- On ribbon graphs and virtual links
- Four color theorem from three points of view
- A state calculus for graph coloring
- A map colour theorem for the union of graphs
- Coloring planar graphs via colored paths in the associahedra
- The Other Map Coloring Theorem
- scientific article; zbMATH DE number 1264993 (Why is no real title available?)
- scientific article; zbMATH DE number 1751599 (Why is no real title available?)
- scientific article; zbMATH DE number 1778086 (Why is no real title available?)
- Four colors do not suffice
- On the map theorem
- Some arithmetical restatements of the four color conjecture
- Multi-virtual knot theory
- Kempe equivalence classes of cubic graphs embedded on the projective plane
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)