Pages that link to "Item:Q638522"

The following pages link to Finding and enumerating Hamilton cycles in 4-regular graphs (Q638522):

Displaying 11 items.

• An improved exact algorithm for TSP in graphs of maximum degree 4 (Q255262) (← links)
• An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure (Q262259) (← links)
• Solution to an open problem on 4-ordered Hamiltonian graphs (Q442328) (← links)
• Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs (Q547792) (← links)
• Parameterized algorithms in smooth 4-regular Hamiltonian graphs (Q943003) (← links)
• Exact algorithms for finding longest cycles in claw-free graphs (Q1939671) (← links)
• Hamiltonian paths and cycles in some 4-uniform hypergraphs (Q2157837) (← links)
• A new upper bound for the traveling salesman problem in cubic graphs (Q2250536) (← links)
• Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs (Q2308511) (← links)
• (Q4203484) (← links)
• The Asymmetric Travelling Salesman Problem In Sparse Digraphs. (Q6089670) (← links)