Complexity of edge coloring in planar graphs Posted by Mohammad Al-Turkistany, at cstheory.stackexchange.com, 31 Oct 2010 3-edge coloring of cubic graphs is $NP$-complete. Four Color Theorem is equivalent to "Every cubic planar bridgeless graphs is 3…