arXiv (All)
open access
The Four Color Theorem meets Shapes of Polyhedra
We consider solutions to the $4$-color problem for the vertices of sphere triangulations with degree sequence $6,...,6,4,4,4,4,4,4$. We sort these solutions into combinatorial types and show that each generic type $τ$ is parametrized by the set of integer lattice points inside a ration
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Perfect Rectangular Tilings with Two Colors#1061927
- From the four-color theorem to a generalizing “four-letter theorem”: A sketch for “human proof” and the philosophical interpretation#759758
- A 21-Coloring of the Plane Without Monochromatic Unit-Area Rectangles#820016
- Hyperplanes Avoiding Problem and Integer Points Counting in Polyhedra#144227
- From semi-total to equitable total colorings#144268
Record · ID 1118521
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive