1 problem

Let $G$ be a connected graph with maximum degree $\Delta$, where $\Delta\geq 3$. A proper conflict-free colouring is a vertex colouring with no monochromatic edges such that every…