Hamiltonian cycles in 1-tough graphs |
| |
Authors: | Bing Wei |
| |
Institution: | (1) Institute of Systems Science, Academia Sinica, 100080 Beijing, China |
| |
Abstract: | For a graphG, let
3 = min{
i=1
3
d(ui): {u1, u2, u3} is an independent set ofG} and
= min{
i=1
3
d(ui) –
is an independent set ofG}. In this paper, we shall prove the following result: LetG be a 1-tough graph withn vertices such that
3 n and
– 4. ThenG is hamiltonian. This generalizes a result of Fassbender 2], a result of Flandrin, Jung and Li 3] and a result of Jung 5].Supported in part by das promotionsstipendium nach dem NaFöG and the Post-Doctoral Foundation of China. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|