References
- Behzad, M. (1965). Graphs and their chromatic numbers Doctoral Thesis. Michigan State University.
- Borodin, O. V. (1989). On the total colouring of planar graphs. J. Reine Angew. Math. 394: 180–185.
- Campos, C. N, De Mello, C. P. (2003). Total colouring of Cn2. Tendencias em Matematica Aplicada e Computacional 4(2): 177–186.
- Geetha, J., Narayanan, N, Somasundaram, K. Total coloring—A survey. https://arxiv.org/abs/1812.05833.
- Geetha, J., Somasundaram, K, Fu, H. L. (2021). Total colorings of circulant graphs. Discrete Math. Algorithm. Appl. 13(05): 2150050.
- Junior, M. N. A, Sasaki, D. (2020). A result on total coloring of circulant graphs. Anais do V Encontro de Teoria da Computação SBC: 81–84.
- Khennoufa, R, Togni, O. (2008). Total and fractional total colourings of circulant graphs. Discrete Math. 308(24): 6316–6329.
- Prajnanaswaroopa, S., Geetha, J, Somasundaram, K. Total coloring for some classes of Cayley graphs. https://arxiv.org/abs/2006.07677.
- Sánchez-Arroyo, A. (1989). Determining the total colouring number is NP-hard. Discrete Math. 78(3): 315–319.
- Vizing, V. G. (1968). Some unsolved problems in graph theory (in Russian). Russ. Math. Surv. 23(6): 125–141.
- Yap, H. P. (1996). Total Colourings of Graphs. Lecture Notes in Mathematics, Vol. 1623. Berlin: Springer.