Lower bound on the number of Hamiltonian cycles of generalized Petersen graphs

DOI10.7151/dmgt.2141zbMath1430.05055OpenAlexW2884786085WikidataQ129523422 ScholiaQ129523422MaRDI QIDQ2282481

Han Ren, Weihua Lu, Chao Yang

Publication date: 8 January 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2141

zbMATH Keywords

1-factorHamiltonian cyclegeneralized Petersen graphpartition number

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Recognizing generalized Petersen graphs in linear time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumeration of Hamiltonian cycles in certain generalized Petersen graphs
• The classification of Hamiltonian generalized Petersen graphs
• Hamiltonian cycles in generalized Petersen graphs
• Every generalized Petersen graph has a Tait coloring
• On the number of hamilton cycles in a random graph
• Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• A theorem on tait colorings with an application to the generalized Petersen graphs
• Variations on the Hamiltonian Theme
• On Hamiltonian Circuits

This page was built for publication: Lower bound on the number of Hamiltonian cycles of generalized Petersen graphs