A State Calculus for Graph Coloring

2015/11/21 by Kauffman, Louis H. · 1 citation
#57M25 #Combinatorics (math.CO) #FOS: Mathematics #Geometric Topology (math.GT) #O5C15

paper · doi:10.48550/arxiv.1511.06844

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.

Cited by

• Categorification of Chromatic, Dichromatic and Penrose Polynomials

Related

• Reformulating the Map Color Theorem
• Algorithmic methods of finite discrete structures. The Four Color Theorem. Theory, methods, algorithms
• A Study on Hand Proof for The Four-Color Theorem
• A sequel to the adventure of RGB-tilings to explore the Four Color Theorem
• A formal proof of the four color theorem