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 we give a simple extension of the Penrose Bracket that counts colorings of arbitrary cubic graphs presented as immersions in the plane.
Citation
Louis H. Kauffman. "A state calculus for graph coloring." Illinois J. Math. 60 (1) 251 - 271, Spring 2016. https://doi.org/10.1215/ijm/1498032032
Information
