An algebraic approach to the planar coloring problem

DOI10.1007/BF02096619zbMath0769.05039MaRDI QIDQ1803205

Hubert Saleur, Louis H. Kauffman

Publication date: 29 June 1993

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

planar coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)

Related Items

Unnamed Item ⋮ Lie algebras and the four color theorem ⋮ Structure of a Hecke algebra quotient ⋮ Some arithmetical restatements of the four color conjecture ⋮ Tutte chromatic identities from the Temperley-Lieb algebra ⋮ Signed permutations and the four color theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zeroes of chromatic polynomials: A new approach to Beraha conjecture using quantum groups
• State models and the Jones polynomial
• Map coloring and the vector cross product
• Hecke algebras of type \(A_ n\) and subfactors
• Limits of chromatic zeros of some families of maps
• Index for subfactors
• Every planar map is four colorable
• Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem