On tne Hamiltonianity of a Graph
Received:November 22, 1986  
Key Words:   
Fund Project:
Author NameAffiliation
Liu Yanpei Institute of Applied Mathematics
Academia Sinica
Hits: 1899
Download times: 1365
      This paper provides a necessary and sufficient condition of a graph being Hamiltonian. On the sufficiency, it is surely wider than that of the closure being the complete graph. Therefore, all the conditions related to the closure being the complete graph, e.g., Dirac's, Ore's et al, and some others with the closure being not the complete graph, especially the one obtained recently by Fan can be easily derived .
View Full Text  View/Add Comment  Download reader