Recommendations
Cites work
- scientific article; zbMATH DE number 3724488 (Why is no real title available?)
- scientific article; zbMATH DE number 3344105 (Why is no real title available?)
- scientific article; zbMATH DE number 3098695 (Why is no real title available?)
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Thirteen Colorful Variations on Guthrie's Four-Color Conjecture
Cited in
(16)- Clifford algebra and 4-color theorem
- On a subposet of the Tamari lattice
- Some arithmetical restatements of the four color conjecture
- Generators and normal forms of Richard Thompson's group \(F\) and the four-color theorem
- One More Probabilistic Reformulation of the Four Colour Conjecture
- scientific article; zbMATH DE number 4010580 (Why is no real title available?)
- An algebraic approach to the planar coloring problem
- Reformulating the map color theorem
- Linear lambda terms as invariants of rooted trivalent maps
- Toward a language theoretic proof of the four color theorem
- Lie algebras and the four color theorem
- The 2-factor polynomial detects even perfect matchings
- Parity, Eulerian subgraphs and the Tutte polynomial
- Coloring planar graphs via colored paths in the associahedra
- Signed diagonal flips and the four color theorem
- Transformation invariance in the combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices
This page was built for publication: Map coloring and the vector cross product
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1099183)
