A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Complexity of the hamiltonian cycle in regular graph problem

1994
*
Theoretical Computer Science
*

Picouleau, C., Complexity of the hamiltonian cycle in regular graph problem, Theoretical Computer Science 131 (1994) 463-473. The problem of deciding whether a 3-regular graph has a hamiltonian cycle (or path) was proved NP-complete. In this paper, we prove that for any fixed k> 3, deciding whether a k-regular graph has a hamiltonian cycle (or path) is a NP-complete problem. When the k-regular graph is planar, deciding whether the graph has a hamiltonian cycle (or path) was proved NP-complete

doi:10.1016/0304-3975(94)90185-6
fatcat:yz7coqv7nvc6flbe27nv6f7zki