The Petersen graph is not 3-edge-colorable---a new proof (Q1398278)
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 3-edge-colorable---a new proof |
scientific article; zbMATH DE number 1956052
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Petersen graph is not 3-edge-colorable---a new proof |
scientific article; zbMATH DE number 1956052 |
Statements
The Petersen graph is not 3-edge-colorable---a new proof (English)
0 references
29 July 2003
0 references
Petersen graph
0 references
edge-coloring
0 references
Hamiltonian cycle
0 references
