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] (Q1886365)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: 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] |
scientific article; zbMATH DE number 2116274
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 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] |
scientific article; zbMATH DE number 2116274 |
Statements
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] (English)
0 references
18 November 2004
0 references
Concerns the paper [\textit{R. Naserasr} and \textit{R. Škrekovski}, Discrete Math. 268, No. 1--3, 325--326 (2003; Zbl 1022.05029)].
0 references
