Title :
One sufficient condition and its applications for Hamiltonian graph using its spanning subgraph
Author :
Liao, Melody Z W ; Huang, X.Q. ; Hu, S.X. ; Chen, W.F.
Author_Institution :
Sch. of Comput. Sci., Sichuan Normal Univ., Chengdu, China
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.
Keywords :
differential equations; graph theory; Hamiltonian graph; graph theory; spanning subgraph; Application software; Automation; Circuits; Computer science; Cybernetics; History; Mercury (metals); Sufficient conditions; Terminology; USA Councils; Eulerian spanning; Hamiltonian graph; spanning subgraph; sufficient condition;
Conference_Titel :
Systems, Man and Cybernetics, 2009. SMC 2009. IEEE International Conference on
Conference_Location :
San Antonio, TX
Print_ISBN :
978-1-4244-2793-2
Electronic_ISBN :
1062-922X
DOI :
10.1109/ICSMC.2009.5345996
