Mathematics – Combinatorics
Scientific paper
2001-12-23
Mathematics
Combinatorics
40 pages, 28 figures, LaTeX graphics
Scientific paper
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.
No associations
LandOfFree
Reformulating the Map Color Theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Reformulating the Map Color Theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reformulating the Map Color Theorem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-250774