Caro–Petru1evski–skrekovski's conflict-free chromatic conjecture
Caro–Petru1evski–skrekovski's conjecture. For every connected graph GGG of maximum degree Δ≥3\Delta\geq 3Δ≥3,