A result on Hamiltonian cycles in generalized Petersen graphs

DOI10.1016/S0095-8956(81)80026-3zbMATH Open0468.05054MaRDI QIDQ1156151FDOQ1156151

Authors: Brian Alspach 

Publication date: 1981

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

zbMATH Keywords

Hamiltonian cyclegeneralized Petersen graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• A theorem on tait colorings with an application to the generalized Petersen graphs
• Every generalized Petersen graph has a Tait coloring
• Hamiltonian cycles in generalized Petersen graphs
• Variations on the Hamiltonian Theme

Cited In (10)

• Brian Alspach and his work
• On the Hamiltonicity of a class of generalized Petersen graphs
• On the Hamiltonicity of a class of generalized Petersen graphs. II
• Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\)
• The classification of Hamiltonian generalized Petersen graphs
• On cycle permutation graphs
• Hyper-Hamiltonian generalized Petersen graphs
• Generalized Petersen graphs which are cycle permutation graphs
• Recognizing generalized Petersen graphs in linear time
• On the nonorientable genus of some generalized Petersen graphs G(n, k) with d=G.C.D.(n, k)>1

This page was built for publication: A result on Hamiltonian cycles in generalized Petersen graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1156151)