COLORING PLANAR GRAPHS VIA COLORED PATHS IN THE ASSOCIAHEDRA
From MaRDI portal
Publication:2854965
DOI10.1142/S0218196713500276zbMath1273.05060arXiv1301.3984MaRDI QIDQ2854965
Matthew G. Brin, Garry S. Bowlin
Publication date: 24 October 2013
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.3984
20F05: Generators, relations, and presentations of groups
05C30: Enumeration in graph theory
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
05C20: Directed graphs (digraphs), tournaments
Related Items
Conjugate subgroups and overgroups of Vn, Generators and normal forms of Richard Thompson's group \(F\) and the four-color theorem, Some properties of Bowlin and Brin's color graphs, Proof of a conjecture of Bowlin and Brin on four-colouring triangulations
Cites Work
- Unnamed Item
- Toward a language theoretic proof of the four color theorem
- On signed diagonal flip sequences
- Signed permutations and the four color theorem
- Map coloring and the vector cross product
- The four-colour theorem
- A theorem on graphs
- Signed diagonal flips and the four color theorem
- Flips signés et triangulations d'un polygone. (Signed flips and triangulations of a polygon)
- Geometric presentations for Thompson's groups.
- The Computational Complexity of Tutte Invariants for Planar Graphs
- A numerical equivalent of the four color map Problem