Neighbor product distinguishing total colorings of corona of subcubic graphs

Aijun Dong, Wenwen Zhang

A proper $[k]$-total coloring $c$ of a graph $G$ is a mapping $c$ from $V(G)\bigcup E(G)$ to $[k]=\{1,2,\cdots ,k\}$ such that $c(x)\ne c(y)$ for which $x$, $y\in V(G)\bigcup E(G)$…