I am curious, is there an edge-coloring theorem that is equivalent to the famous Four Color Theorem?
In graph-theoretic terminology, the four-color theorem states that the vertices of every planar graph can be colored with at most four colors so that no two adjacent vertices receive the same color, or for short, "every planar graph is four-colorable"
When vertex-coloring is replaced by edge-coloring, is there an equivalent result?
If no such equivalent result exists, is there a “similar” result?
Thanks a lot.