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]

DOI10.1016/J.DISC.2004.07.008zbMath1053.05054OpenAlexW2024421715MaRDI QIDQ1886365

Lutz Volkmann

Publication date: 18 November 2004

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

Full work available at URL: https://doi.org/10.1016/j.disc.2004.07.008

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

The chromatic index of strongly regular graphs ⋮ The smallest pair of cospectral cubic graphs with different chromatic indexes

Cites Work

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

This page was built for publication: 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]