Enumeration of Hamiltonian cycles in certain generalized Petersen graphs

DOI10.1016/0095-8956(89)90064-6zbMath0626.05038OpenAlexW2080276486WikidataQ55869274 ScholiaQ55869274MaRDI QIDQ580371

Allen J. Schwenk

Publication date: 1989

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(89)90064-6

zbMATH Keywords

classificationHamiltonicitygeneralized Petersen graphnumber of Hamiltonian cycles

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Eulerian and Hamiltonian graphs (05C45)

Related Items (14)

Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\) ⋮ Hamilton-connectivity of line graphs with application to their detour index ⋮ Uniquely forced perfect matching and unique 3-edge-coloring ⋮ Regular Graphs with Few Longest Cycles ⋮ Unnamed Item ⋮ On the minimum vertex cover of generalized Petersen graphs ⋮ Enumeration of labeled and unlabeled Hamiltonian cycles in complete \(k\)-partite graphs ⋮ Lower bound on the number of Hamiltonian cycles of generalized Petersen graphs ⋮ Graphs with few hamiltonian cycles ⋮ Unnamed Item ⋮ Highly-connected planar cubic graphs with few or many Hamilton cycles ⋮ On \((a,b)\)-consecutive Petersen graphs ⋮ On perfectly one–factorable cubic graphs ⋮ On the Hamiltonicity of a class of generalized Petersen graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The classification of Hamiltonian generalized Petersen graphs
• Hamiltonian cycles in generalized Petersen graphs
• Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• Uniquely Line Colorable Graphs
• A theorem on tait colorings with an application to the generalized Petersen graphs
• Variations on the Hamiltonian Theme

This page was built for publication: Enumeration of Hamiltonian cycles in certain generalized Petersen graphs