A sufficient condition for hamiltonian circuits |
| |
Authors: | DR Woodall |
| |
Institution: | Department of Mathematics, University of Nottingham, Nottingham, England NG7 2RD |
| |
Abstract: | A theorem is proved that is (in a sense) the best possible improvement on the following theme: If G is an undirected graph on n vertices in which for every non-empty subset S of the vertices of G, then G is Hamiltonian. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|