Return to Revisions

Yes. For weak colorings, we may replace each edge with at least 2 vertices to an edge with exactly 2 vertices. It remains to properly color a graph with $n$ edges with $n$ colors. This is done by induction: color any vertex of any edge in a color $n-1$, remove the edges incident to this vertex and proceed.