An extension of the multi-path algorithm for finding Hamilton cycles

DOI10.1016/0012-365X(92)90601-BzbMath0761.05088MaRDI QIDQ1197026

William L. Kocay

Publication date: 16 January 1993

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

zbMATH Keywords

Hamilton cyclesmulti-path algorithm

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle ⋮ Hamiltonian cycle curves in the space of discounted occupational measures ⋮ Counting Hamiltonian cycles in bipartite graphs

Cites Work

• A Search Procedure for Hamilton Paths and Circuits
• Dividing a Graph into Triconnected Components
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An extension of the multi-path algorithm for finding Hamilton cycles