arXiv (All)
open access
The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring
We give a near-linear time 4-coloring algorithm for planar graphs, improving on the previous quadratic time algorithm by Robertson et al. from 1996. Such an algorithm cannot be achieved by the known proofs of the Four Color Theorem (4CT). Technically speaking, we show the following significant gener
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
- Frugal coloring in planar graphs with maximum degree 4 and 5#1296647
- Conflict-Free Coloring Planar Graphs with 4 Colors#615074
- Conflict-Free Coloring Planar Graphs with 4 Colors#614107
- A Brooks-like result for graph powers $#983875
- The Borowiecki-Broere Generalized Total Coloring Conjecture for Planar Graphs#1154714
Record · ID 1186427
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