One sufficient condition and its applications for hamiltonian graph using its spanning subgraph

Authors:
Melody Z. W. Liao;S. X. Hu;X. Q. Huang;W. F. Chen
Affiliations:
School of Computer Science, Sichuan Normal University, Chengdu, China;School of Automation Engineering, University of Electronic Science and Technology of China, Chengdu, China;Suzhou Non-ferrous Metal Research Institute, Suzhou, China;School of Automation Engineering, University of Electronic Science and Technology of China, Chengdu, China
Venue:
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Year:
2009

Citing 9
Cited 0

Solving the Hamiltonian cycle problem via an artificial neural network

Information Processing Letters
Hamiltonian cycles in n-factor-critical graphs

Discrete Mathematics
Hamiltonian cycles in 3-connected claw-free graphs

Discrete Mathematics
Parallel algorithms for Hamiltonian problems on quasi-threshold graphs

Journal of Parallel and Distributed Computing
On packing Hamilton cycles in ε-regular graphs

Journal of Combinatorial Theory Series B
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs

Theoretical Computer Science
On the hamiltonicity of the cartesian product

Information Processing Letters
On Hamiltonian cycles and Hamiltonian paths

Information Processing Letters
Exact algorithms for the Hamiltonian cycle problem in planar graphs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.