Hamiltonian cycles in generalized Petersen graphs

DOI10.1016/0095-8956(78)90019-9zbMath0376.05034OpenAlexW2009407495MaRDI QIDQ1245847

Kozo Bannai

Publication date: 1978

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(78)90019-9

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items

Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\), Fault diameter of interconnection networks, Unnamed Item, A result on Hamiltonian cycles in generalized Petersen graphs, Lifting Hamilton cycles of quotient graphs, A survey: Hamiltonian cycles in Cayley graphs, Hyper-Hamiltonian generalized Petersen graphs, A survey: Hamiltonian cycles in Cayley graphs, On the nonorientable genus of some generalized Petersen graphs G(n, k) with d=G.C.D.(n, k)>1, Enumeration of Hamiltonian cycles in certain generalized Petersen graphs, Cayley graphs on groups with commutator subgroup of order <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mn>2</mml:mn><mml:mi>p</mml:mi></mml:math> are hamiltonian, Lower bound on the number of Hamiltonian cycles of generalized Petersen graphs, On the Hamilton connectivity of generalized Petersen graphs, Generalized Petersen graphs which are cycle permutation graphs, The classification of Hamiltonian generalized Petersen graphs, On \((a,b)\)-consecutive Petersen graphs, Connected Cayley graphs of semi-direct products of cyclic groups of prime order by Abelian groups are Hamiltonian

Cites Work

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