One sufficient condition and its applications for Hamiltonian graph using its spanning subgraph
Melody Z. W. Liao, Xiu-Qin Huang, Shun Hu, Weipeng Chen · 2009
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.