Hamiltonian Circuit Algorithm
Library Home || Full Table of Contents || Suggest a Link || Library Help
|A new algorithm for finding Hamiltonian circuits in graphs with a constructive proof of Dirac's theorem, applications to finding Knight's Tours and a demonstration program, by Ashay Dharwadker.|
|Resource Types:||Graphics, Articles, Software|
|Math Topics:||Graph Theory|
© 1994-2013 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.