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

DOI10.1016/S0012-365X(03)00138-9zbMath1022.05029MaRDI QIDQ1398278

Riste Škrekovski, Reza Naserasr

Publication date: 29 July 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

edge-coloringHamiltonian cyclePetersen graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

The Petersen graph is not 1-factorable: postscript to `The Petersen graph is not 3-edge-colorable -- a new proof' [Discrete Math. 268 (2003) 325--326] ⋮ The chromatic index of strongly regular graphs ⋮ The smallest pair of cospectral cubic graphs with different chromatic indexes

Cites Work

• Unnamed Item

This page was built for publication: The Petersen graph is not 3-edge-colorable---a new proof