5 problems

Let $G$ be a graph with maximum degree $\Delta$. In the natural list version of neighbour sum distinguishing total colouring, colours are chosen from arbitrary lists of real number…

Let $G$ be a graph with maximum degree $\Delta$, and let $\chi”_{\sum}(G)$ denote the least number of colours in a proper total colouring whose weighted degrees distinguish adjacen…

Zhang–Chen–Li–Yao–Lu–Wang's conjecture. For every graph $G$,

Skowronek-Kaziόw's conjecture. For every graph $G$,

Total 1-2 Conjecture. For every graph $G$,