The Total Coloring Conjecture holds for planar graphs without three special subgraphs
Combinatorics
2025-07-18 v1
Abstract
The Total Coloring Conjecture (TCC) for planar graphs with a maximum degree of six remains open. Previous studies suggest that TCC is valid for such graphs if they do not contain any subgraph isomorphic to a 4-fan. In this paper, we present an improved conclusion by establishing that TCC holds for planar graphs that are free of three particular substructures, namely the mushroom, the tent, and the cone. This advancement enhances previous findings by demonstrating that TCC is applicable to planar graphs with a maximum degree of six, which can accommodate sparse 4-fans, 5-fans, 5-wheels, and 6-wheels.
Cite
@article{arxiv.2507.12737,
title = {The Total Coloring Conjecture holds for planar graphs without three special subgraphs},
author = {Rongjin Su and Gang Fang and Enqiang Zhu},
journal= {arXiv preprint arXiv:2507.12737},
year = {2025}
}