Total Colorings of Join Graph C_n∨K_(n-3,n)
Ming Chen · Journal of Jiaxing University · 2010
Vizing and Behazd independently conjectured that every simple graph with maximum degree Δ is Δ+2 totally colorable. In this paper,we explore the graph edge coloring through the whole graph coloring and prove that the graph G = C n ∨ K n-3,n not only satisfies TCC,but also belongs to the first type,that is χ″(G) = Δ(G) + 1 .