Saved in:
Bibliographic Details
Main Authors: Su, Rongjin, Fang, Gang, Zhu, Enqiang
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2507.12737
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916847944728576
author Su, Rongjin
Fang, Gang
Zhu, Enqiang
author_facet Su, Rongjin
Fang, Gang
Zhu, Enqiang
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2507_12737
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle The Total Coloring Conjecture holds for planar graphs without three special subgraphs
Su, Rongjin
Fang, Gang
Zhu, Enqiang
Combinatorics
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.
title The Total Coloring Conjecture holds for planar graphs without three special subgraphs
topic Combinatorics
url https://arxiv.org/abs/2507.12737