ON THE TOTAL CHROMATIC NUMBER OF ODD LINE GRAPHS OF ODD COMPLETE GRAPHS
Advances and Applications in Discrete Mathematics · 06.04.2026 · 43 (3) · 337-352
DOI: 10.17654/0974165826022 ↗Kurz gefasst
Fachartikel in der Zeitschrift Advances and Applications in Discrete Mathematics, online erschienen am 06.04.2026. Verfasst von S. Thatchayani und 2 weiteren Autor:innen.
Abstract (Originalsprache)
A total coloring of a graph entails the meticulous assignment of colors to both vertices and edges, ensuring that neither two adjacent vertices nor two adjacent edges receive the same color. Furthermore, it requires that for each edge, the colors of its end-points and the edge itself must differ. The total chromatic number of a graph , indicated as , signifies the minimum number of colors required for such a total coloring. The renowned conjecture by Behzad and and Vizing asserts that for any graph , the inequality holds, where signifies the graph's maximum degree. In this paper, we obtain that odd line graphs of odd complete graphs , where and (with being odd), can be adorned with a total coloring with colors.
Zitieren
APA
Thatchayani, S., Geethalakshmi, S., & Somasundaram, K. (2026). ON THE TOTAL CHROMATIC NUMBER OF ODD LINE GRAPHS OF ODD COMPLETE GRAPHS. Advances and Applications in Discrete Mathematics, 43(3), 337-352. https://doi.org/10.17654/0974165826022
Vancouver
Thatchayani S, Geethalakshmi S, Somasundaram K. ON THE TOTAL CHROMATIC NUMBER OF ODD LINE GRAPHS OF ODD COMPLETE GRAPHS. Advances and Applications in Discrete Mathematics. 2026;43(3):337-352. doi:10.17654/0974165826022
BibTeX
@article{Thatchayani2026,
author = {Thatchayani, S. and Geethalakshmi, S. and Somasundaram, K.},
title = {ON THE TOTAL CHROMATIC NUMBER OF ODD LINE GRAPHS OF ODD COMPLETE GRAPHS},
journal = {Advances and Applications in Discrete Mathematics},
year = {2026},
volume = {43},
number = {3},
pages = {337--352},
doi = {10.17654/0974165826022}
}
EUVIMED