Total Coloring Conjecture for Certain Classes of Graphs
Keyword(s):
A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no two adjacent or incident elements receive the same color. The total chromatic number of a graph G, denoted by χ ′ ′ ( G ) , is the minimum number of colors that suffice in a total coloring. Behzad and Vizing conjectured that for any graph G, Δ ( G ) + 1 ≤ χ ′ ′ ( G ) ≤ Δ ( G ) + 2 , where Δ ( G ) is the maximum degree of G. In this paper, we prove the total coloring conjecture for certain classes of graphs of deleted lexicographic product, line graph and double graph.
2019 ◽
Vol 11
(01)
◽
pp. 1950014
Keyword(s):
2018 ◽
Vol 10
(02)
◽
pp. 1850018
Keyword(s):
2011 ◽
Vol 474-476
◽
pp. 2341-2345
Keyword(s):
2013 ◽
Vol 475-476
◽
pp. 379-382
Keyword(s):
Keyword(s):
2020 ◽
Vol 12
(02)
◽
pp. 2050021
Keyword(s):
1996 ◽
Vol 162
(1-3)
◽
pp. 199-214
◽
2015 ◽
Vol Vol. 17 no. 1
(Graph Theory)
◽
Keyword(s):