arXiv (All)
open access
The Borowiecki-Broere Generalized Total Coloring Conjecture for Planar Graphs
We prove the conjecture of Borowiecki and Broere that every finite simple planar graph admits a generalized total coloring with four colors: a proper vertex coloring with four colors together with an edge coloring with four colors in which each edge color class is a forest and no edge receives the c
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
- 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
- More on Rainbow Cliques in Edge-Colored Graphs#1122876
- The Remaining $K_4$-Free Case in the Multipartite Clique Problem#1013778
Record · ID 1154714
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