A heuristic method for the determination of a Hamiltonian circuit in a graph

DOI10.1017/S0334270000005439MaRDI QIDQ3754025zbMATH OpenFDO

Authors Sudhangshu B. Karmakar

Publication date 1987

Published in The Journal of the Australian Mathematical Society. Series B. Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

adjacency matrixcircuitHamiltonian

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Recommendations

• DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits
• Enumeration of Hamiltonian circuits in digraphs
• A method for finding Hamilton paths and Knight's tours
• Heuristic search for Hamilton cycles in cubic graphs
• An algorithm for finding all Hamiltonian cycles in a simple graph via hierarchical correlation

Cited in

(2)

• DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits
• scientific article; zbMATH DE number 3861199 (Why is no real title available?)

This page was built for publication: A heuristic method for the determination of a Hamiltonian circuit in a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3754025)