2 problems

The 1-2 Conjecture. Every graph has a total $2$-weighting whose resulting vertex sums form a proper colouring; equivalently,

Let $G$ be a graph, and let $\chi_{at}(G)$ denote its adjacent vertex distinguishing total chromatic number, the least number of colours in a proper total colouring such that every…