A State Calculus for Graph Coloring
Combinatorics
2016-06-16 v2 Geometric Topology
Abstract
This paper discusses reformulations of the problem of coloring plane maps with four colors. We give a number of alternate ways to formulate the coloring problem including a tautological expansion similar to the Penrose Bracket, and an extension of the Penrose Bracket that counts colorings of arbitrary cubic graphs presented as immersions in the plane.
Cite
@article{arxiv.1511.06844,
title = {A State Calculus for Graph Coloring},
author = {Louis H. Kauffman},
journal= {arXiv preprint arXiv:1511.06844},
year = {2016}
}
Comments
20 pages, 20 figures, LaTeX document. arXiv admin note: text overlap with arXiv:math/0112266