The Petersen graph is not 3-edge-colorable--a new proof

Reza Naserasr, Riste Skrekovski. The Petersen graph is not 3-edge-colorable--a new proof. Discrete Mathematics, 268(1-3):325-326, 2003. [doi]

Abstract

Abstract is missing.