FHCP Challenge Set: The First Set of Structurally Difficult Instances of the Hamiltonian Cycle Problem

zbMath1400.05141arXiv1902.10352MaRDI QIDQ5376425

Michael Haythorpe

Publication date: 17 September 2018

Full work available at URL: https://arxiv.org/abs/1902.10352

zbMATH Keywords

Hamiltonian cycle problem

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items

An interdisciplinary experimental evaluation on the disjunctive temporal problem, HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle, COMPARISON OF SUFFICIENT DEGREE BASED CONDITIONS FOR HAMILTONIAN GRAPH, Finding Hamiltonian Cycle in Graphs of Bounded Treewidth, Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples, Chinese remainder encoding for Hamiltonian cycles