The smallest integer k needed for the assignment of k colors to the elements so that the
coloring is proper (vertices and edges) is called the total chromatic number of a graph …

An equitable total coloring is the assignment of colors to the edges and vertices of a graph G
so that incident and adjacent elements receive different colors, and the difference between …

A total coloring is equitable if the number of elements colored by any two distinct colors
differs by at most one. The equitable total chromatic number of a graph (χ e ″) is the …

An equitable total coloring is the assignment of colors to the vertices and edges of a graph
such that incident and adjacent elements receive different colors and the difference between …

A proper total coloring of a graph is an assignment of colors to its vertices and edges such
that any two adjacent or incident elements have distinct colors. An equitable total coloring is …

广义Petersen图P(nꎬk)的等全着色 Page 1 山东大学学报(理学版)2024年2月第59卷第2期 E-mail:xblxb@sdu.edu.cn
Journal of Shandong University(Natural Science)ꎬ Vol.59ꎬ No.2ꎬ 2024 http:/ / lxbwk.njournal.sdu.edu.cn …