Sufficient conditions for a graph to be Hamiltonian |
| |
| Authors: | S Goodman S Hedetniemi |
| |
| Affiliation: | Department of Applied Mathematics and Computer Science, University of Virginia, Charlottesville, Virginia 22901 USA |
| |
| Abstract: | Three sufficient conditions for a graph to be Hamiltonian are given. These theorems are in terms of subgraph structure and do not require the fairly high global line density which is basic to the Pósa-like sufficiency conditions. Line graphs of both Eulerian graphs and Hamiltonian graphs are also characterized. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
