Total Coloring of Dumbbell Maximal Planar Graphs
-
Published:2022-03-13
Issue:6
Volume:10
Page:912
-
ISSN:2227-7390
-
Container-title:Mathematics
-
language:en
-
Short-container-title:Mathematics
Author:
Zhou Yangyang,Zhao Dongyang,Ma Mingyuan,Xu Jin
Abstract
The Total Coloring Conjecture (TCC) states that every simple graph G is totally (Δ+2)-colorable, where Δ denotes the maximum degree of G. In this paper, we prove that TCC holds for dumbbell maximal planar graphs. Especially, we divide the dumbbell maximal planar graphs into three categories according to the maximum degree: J9, I-dumbbell maximal planar graphs and II-dumbbell maximal planar graphs. We give the necessary and sufficient condition for I-dumbbell maximal planar graphs, and prove that any I-dumbbell maximal planar graph is totally 8-colorable. Moreover, a linear time algorithm is proposed to compute a total (Δ+2)-coloring for any I-dumbbell maximal planar graph.
Funder
National Key R&D Program of China
National Natural Science Foundation of China
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference20 articles.
1. Graph Theory with Applications;Bondy,1976
2. On an estimate of the chromatic class of a p-graph;Vizing;Discret. Anal.,1964
3. On the total coloring of certain graphs
4. On Total Chromatic Number of a Graph