Systems, Man, and Cybernetics

 

Home

• [P503] One Sufficient Condition for Hamiltonian Graph Using Its Spanning Subgraph
  Author(s): Zhiwu Melody Liao
  
  

  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 an Eulerian spanning subgraph. We also give the procedures of the method, which can be used directly on computer.

  
   

Full Text (PDF)