Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable (Q3958483)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable |
scientific article |
Statements
Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable (English)
0 references
1982
0 references
edge coloring
0 references
generalized Petersen graph
0 references
