It is trivially true for all that are 3-edge-colorable -- which is the vast majority. Among the rest, I checked it using computer and lists of snarks for all graphs upto 34 vertices. (And some more -- e.g. all flower-snarks.)

Best wishes, Robert

## Re:

It is trivially true for all that are 3-edge-colorable -- which is the vast majority. Among the rest, I checked it using computer and lists of snarks for all graphs upto 34 vertices. (And some more -- e.g. all flower-snarks.)

Best wishes, Robert