Finding and enumerating Hamilton cycles in 4-regular graphs
type: Item
instance of: scholarly article
title: Finding and enumerating Hamilton cycles in 4-regular graphs
zbMATH Open document ID: 1226.05143
author: Heidi Gebauer
published in: Theoretical Computer Science
publication date: 2011-09-12T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5947156
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: Hamilton cycles
zbMATH Keywords: regular graphs
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.04.038
OpenAlex ID: W2008391796
cites work: The Travelling Salesman Problem in Bounded Degree Graphs
cites work: The Traveling Salesman Problem for Cubic Graphs
cites work: Q4198056
cites work: Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs
cites work: On the Number of Hamilton Cycles in Bounded Degree Graphs
cites work: A Dynamic Programming Approach to Sequencing Problems
cites work: An Improved Exact Algorithm for Cubic Graph TSP
cites work: On the number of crossing-free matchings, (cycles, and partitions)
cites work: Q4414647
DOI: 10.1016/J.TCS.2011.04.038
Recommended article: 4-regular 4-connected Hamiltonian graphs with few Hamiltonian cycles
Recommended article: Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs
Recommended article: Hamiltonian paths and cycles in some 4-uniform hypergraphs
Recommended article: Hamiltonian cycles in regular graphs
Recommended article: Q3987244
Recommended article: On the Minimum Number of Hamiltonian Cycles in Regular Graphs
Recommended article: Hamiltonicity of 4-connected graphs
Recommended article: Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs
Recommended article: A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
Recommended article: Finding Hamiltonian cycles in certain planar graphs
description: scientific article; zbMATH DE number 5947156