✦ LIBER ✦
Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable
✍ Scribed by Andrew Thomason
- Publisher
- John Wiley and Sons
- Year
- 1982
- Tongue
- English
- Weight
- 138 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
The generalized Petersen graph P(6__k__ + 3, 2) has exactly 3 Hamiltonian cycles for k ≥ 0, but for k ≥ 2 is not uniquely edge colorable. This disproves a conjecture of Greenwell and Kronk [1].