On a Sufficient Condition for Planar Graphs of Maximum Degree 6 to be Totally 7-Colorable

Enqiang Zhu, Chanjuan Liu, Yongsheng Rao

A total $k$-coloring of a graph is an assignment of $k$ colors to its vertices and edges such that no two adjacent or incident elements receive the same color. The Total Coloring C…