The total coloring of $K_5$-minor-free graphs

Fan Yang, Jianliang Wu

A total $k$-coloring of a graph $G$ is a coloring of $V(G)\cup E(G)$ using $k$ colors such that no two adjacent or incident elements receive the same color. The total chromatic num…