References
- M. Bezhad, Graphs and their chromatic numbers, Doctoral Thesis, Michigan State University, 1965.
- M. Behzad, G. Chartrand and J.K. Cooper, The color numbers of complete graphs, Journal London Math. Soc. 42 (1967), 226-228. https://doi.org/10.1112/jlms/s1-42.1.226
- M. Behzad, A criterian for the planarity of the total graph of a graph, Proc. Cambridge Philos. Soc. 63 (1967), 679-681. https://doi.org/10.1017/S0305004100041657
- O.V. Borodin, On the total coloring planar graphs, J. Reine Angew Math. 394 (1989), 180-185.
- G. Jayaraman and D. Muthuramakrishnan, Total Chromatic Number of Double Star Graph Families, Journal of Advanced Research in Dynamical and control system 10 (2018), 631-635.
- G. Jayaraman and D. Muthuramakrishnan, Total Coloring of Middle, Total graph of Bistar, Double wheel and Double Crown Graph, International Journal of Scientific Research and Review 7 (2018), 442-450.
- A.V. Kostochka, The total coloring of a multigraph with maximal degree 4, Discrete Math. 17 (1989), 161-163. https://doi.org/10.1016/0012-365X(77)90146-7
- R. Ponraj and S. Sathish Narayanan, Mean cordiality of some snake graphs, Palastine Journal of Mathematics 4 (2015), 439-445.
- M. Rosanfeld, On the total colouring of certain graphs, Israel J. Math. 9 (1972), 396-402. https://doi.org/10.1007/BF02771690
- N. Vijayaditya, On total chromatic number of a graph, J. London Math Soc. (1971), 405-408.
- V.G. Vizing, Some unsolved problems in graph theory, Russian Mathematical Survey 23 (1968), 125-141. https://doi.org/10.1070/RM1968v023n06ABEH001252