Abstract:
Determinating whether a graph is Hamiltonian is a open difficult problem. In this paper, the problem is converted to determinating whether the graph has a 2-regular Hamil...Show MoreMetadata
Abstract:
Determinating whether a graph is Hamiltonian is a open difficult problem. In this paper, the problem is converted to determinating whether the graph has a 2-regular Hamiltonian spanning subgraph. We also give the procedures of the method, which can be used directly on computer.
Date of Conference: 11-14 October 2009
Date Added to IEEE Xplore: 04 December 2009
ISBN Information:
Print ISSN: 1062-922X
Contents 