Article ID Journal Published Year Pages File Type
4949604 Discrete Applied Mathematics 2017 6 Pages PDF
Abstract
It is known that Total Coloring Conjecture (TCC) was verified for planar graphs with maximum degree Δ≠6. In this paper, we prove that TCC holds for planar graphs G with Δ(G)=6, if G does not contain any subgraph isomorphic to a 4-fan.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
Authors
, ,