Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles

DOI10.1016/j.disc.2008.11.003zbMath1184.05078OpenAlexW2159599758MaRDI QIDQ1045171

Zdzisław Skupień

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.11.003

zbMATH Keywords

multigraphHamiltonian pairconstructioncounting Hamilton cyclessquared cycletraceable pair

Mathematics Subject Classification ID

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

Related Items (1)

Recent advances on the Hamiltonian problem: survey III

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Independent dominating sets and a second hamiltonian cycle in regular graphs
• On sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• Pairs of Adjacent Hamiltonian Circuits with Small Intersection
• Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs
• Decompositions into two paths
• Computer Solutions of the Traveling Salesman Problem
• Hamiltonian cycles in a graph of degree 4
• On Hamiltonian Circuits

This page was built for publication: Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles