A data structure useful for finding Hamiltonian cycles
- 10 April 1990
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 71 (3) , 419-424
- https://doi.org/10.1016/0304-3975(90)90053-k
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Hamiltonian Cycles and Uniquely Edge Colourable GraphsPublished by Elsevier ,1978
- Hamiltonian circuits in random graphsDiscrete Mathematics, 1976