Toward a language theoretic proof of the four color theorem

DOI10.1016/j.aam.2011.11.002zbMath1237.05005arXiv1006.1324OpenAlexW3123297068MaRDI QIDQ408127

Doron Zeilberger, Bobbe J. Cooper, Eric S. Rowland

Publication date: 29 March 2012

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1006.1324

zbMATH Keywords

four color theoremparse words

Mathematics Subject Classification ID

Trees (05C05) Combinatorics on words (68R15) Permutations, words, matrices (05A05) Coloring of graphs and hypergraphs (05C15) Grammars and rewriting systems (68Q42)

Related Items (3)

On a subposet of the Tamari lattice ⋮ LOU ⋮ COLORING PLANAR GRAPHS VIA COLORED PATHS IN THE ASSOCIAHEDRA

Uses Software

• BinaryTrees

Cites Work

• On a subposet of the Tamari lattice
• Map coloring and the vector cross product
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility

This page was built for publication: Toward a language theoretic proof of the four color theorem