加载中…
In 2020, Panda, Verma, and Keerti asked whether the central graph of every graph satisfies the AVD-total coloring conjecture. In this paper, we verify the conjecture for central graphs of regular graphs, complete bipartite graphs, graphs that can be expressed as the join of two graphs of the same order, and several other graph classes, thereby providing partial progress towards this open problem. We further determine the AVD-total chromatic number of subdivision graphs and establish new results on the AVD-total coloring of joins of graphs.

生成讲解博客的中文版本

生成AI智能校验的中文版本