no. 12 · Tuesday 10 November 2026
AVD Total Colorings of Subdivision Graphs, Joins, and Deleted Lexicographic Products
Abstract
In 2020, Panda, Verma, and Keerti asked whether the central graph of every graph satisfies the AVD-total coloring conjecture (AVD-TCC). In this paper, we use idempotent commutative Latin squares and a theorem of Borodin, Kostochka, and Woodall to prove the AVD-TCC for central graphs of all connected graphs with order at least five and minimum degree at least two. We further determine the AVD-total chromatic number of subdivision graphs of connected graphs and establish new results on the AVD-total coloring of joins of graphs, central graphs, and deleted lexicographic products.
- comments
- Two changes. Theorem 4.9 and Theorem 3.4 have been revised. The result in Theorem 4.9 has been substantially strengthened: we prove that the AVD-TCC holds for central graphs of all connected graphs of order at least five and minimum degree at least two. An incorrect assumption in Theorem 3.4 has been corrected
- fields
- Combinatorics