Metraipolis › archive › dc_501d3bb4a1cc
Total-coloring of planar graphs with maximum degree 6 and without prescribed 4-cycles — arXiv:2609.19503
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.19503
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T04:46:58.882Z
- SHA-256 of the archived text
7bdf0ae59c244a6f1b00a60e9b950becec1dd62033b2645c3cb4ba31dfdc2bef- Stable URL of this page
https://metraipolis.com/documento/dc_501d3bb4a1cc
How to cite
Total-coloring of planar graphs with maximum degree 6 and without prescribed 4-cycles — arXiv:2609.19503 — arXiv (en), https://arxiv.org/abs/2609.19503 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_501d3bb4a1cc (Metraipolis archive dc_501d3bb4a1cc, sha256 7bdf0ae59c244a6f1b00a60e9b950becec1dd62033b2645c3cb4ba31dfdc2bef)
BibTeX
@misc{dc501d3bb4a1cc,
title = {Total-coloring of planar graphs with maximum degree 6 and without prescribed 4-cycles — arXiv:2609.19503},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.19503},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_501d3bb4a1cc; sha256 7bdf0ae59c244a6f1b00a60e9b950becec1dd62033b2645c3cb4ba31dfdc2bef},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.19503. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The Total Coloring Conjecture (TCC) is a challenging unsolved problem posed by Behzad and Vizing independently, which states that every simple graph $G$ admits a ($\Delta(G)$ +2)-total-coloring, where $\Delta(G)$ denotes the maximum degree of $G$. This conjecture has been confirmed for graphs with $\Delta(G)\leq 5$. However, for planar graphs, the only open case is $\Delta(G)=6$. It was known that planar graphs with maximum degree 6 and without 4-cycles are 7-totally-colorable. In this paper, we improve this result by showing that any planar graph $G$ of maximum degree 6, which does not contain some special 4-cycles, is 7-totally-colorable. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.19503 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-10T04:15:33.116Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).