Keywords:-
Article Content:-
Abstract
Total colouring of a Graph preserves adjacent relation, incident relation of vertices and edges respectively. In this study relation between Total chromatic number & chromatic number of graphs is observed. Some algebraic nature of Total chromatic number and Total graph is investigated.
References:-
References
T. Murthy, “A proof of the total coloring conjecture,” arXiv, 2020.
P. &. N. J. Hell, Graphs and homomorphisms, Oxford University Press, 2004.
G. &. Z. P. Chartrand, Chromatic graph theory, CRC Press, 2009.
R. J. Wilson, Introduction to graph theory, Pearson Education India, 1979.
F. E. C.-M. J. M.-G. B. R.-T. R.-M. M. Gabriela Araujo-Pardo, “Complete colorings of planar graphs,” Discrete Applied Mathematics, vol. Vol. 255, p. pp. 86–97, 2019.
T. Murthy, “A proof of the total coloring conjecture,” (CoRR, abs/2003.09658). arXiv., 2020.
H.-P. Yap, “Total colourings of graphs,” lecture notes in mathematics, vol. 1623, 1996.
O. V. Borodin, “On the total coloring of planar graphs,” 1989.
N. N. a. K. S. Jayabalan Geetha, “ Total colorings-a survey,” AKCE International Journal of Graphs and Combina, p. 1–13, 2023.
V. Kostochka, “The total coloring of a multigraph with maximal degree 4,” Discrete Mathematics, vol. 17, no. 2, p. 161–163, 1977.
V. Kostochka, “The total chromatic number of any multigraph with maximum degree five is at most seven,” Discrete Mathematics, vol. 162, no. 1–3, p. 199–214, 1996.
M. Rosenfeld, “On the total coloring of certain graphs,” Israel Journal of Mathematics, vol. 9, p. 396–402, 1971.
N. Vijayaditya, “On total chromatic number of a graph,” Journal of the London Mathematical Society, vol. 3, no. 3, p. 405–408, 1971.
D. S. &. C. P. d. Mello, “Edge-colouring of join graphs,” Theoretical Computer Science, vol. 355, no. 3, p. 364–370, 2006.
Campos, C. N., de Mello, C. P. (2005). The total chromatics number of some bipartite graphs. Electr. Notes Discrete Math. 22: 557–561.
Chetwynd, A. G., Hilton, A. J. W., Cheng, Z. (1991). The total chromatic number of graphs of high minimum degree. J. London Math. Soc. s2-44(2): 193–202.