Complexity of the hamiltonian cycle in regular graph problem
Author:
- C. PicouleauCPC. Picouleau
- 1 September 1994
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 131 (2) , 463-473
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- The Planar Hamiltonian Circuit Problem is NP-CompleteSIAM Journal on Computing, 1976