1982/06/01 by Andrew Thomason · 2 citations
Engineering · Mathematics · Computer Science · #graph theory and CDMA systems #Limits and Structures in Graph Theory #Advanced Graph Theory Research #Mathematics #Combinatorics #Conjecture #Cubic graph #Hamiltonian (control theory) #Hamiltonian path #Graph #Discrete mathematics #Line graph #Voltage graph
paper · doi:10.1002/jgt.3190060218
openalex publication_date 1982/06/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/05/21
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].