2 problems

Let $G=(V,E)$ be a connected graph with at least two edges. A $3$-weighting of $G$ is a mapping $\omega:E\to\{1,2,3\}$, and it is vertex-colouring if the weighted degree…

Czerwiński–Grytczuk–Żelazny's conjecture. For every graph $G$,