On the Number of Hamilton Cycles in Bounded Degree Graphs
From MaRDI portal
Publication:5194650
DOI10.1137/1.9781611972986.8zbMath1429.05113OpenAlexW2296469570MaRDI QIDQ5194650
Publication date: 16 September 2019
Published in: 2008 Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5b02d08525eba4bf520eaf69d951e3cca57b852b
Enumeration in graph theory (05C30) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items (6)
Spotting Trees with Few Leaves ⋮ Spotting Trees with Few Leaves ⋮ Finding and enumerating Hamilton cycles in 4-regular graphs ⋮ On the Minimum Number of Hamiltonian Cycles in Regular Graphs ⋮ The Asymmetric Travelling Salesman Problem In Sparse Digraphs. ⋮ Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
This page was built for publication: On the Number of Hamilton Cycles in Bounded Degree Graphs
