How can you prove that a cubic graph with a bridge cannot be 3-edge colored?
I guess one could try a proof by contradiction, so we assume a 3 edge coloring is possible for such a graph. By than I am not sure in which direction to continue.
Or maybe a proof by contrapositive, so let say we have a cubic graph with a 3-edge coloring. How do we show this graph is bridgeless?