Abstract
AbstractThe generalized Petersen graph P(6k + 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].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have