|
|||||
|
|
A generalization of dirac’s theorem |
|
| Authors: | Stephen C Locke |
| Institution: | (1) Department of Mathematics, Florida Atlantic University, 33431 Boca Raton, Fla, USA |
| Abstract: | LetG be an (r+2)-connected graph in which every vertex has degree at leastd and which has at least 2d-r vertices. Then, for any pathQ of lengthr and vertexy not onQ, there is a cycle of length at least 2d-r containing bothQ andy. |
| Keywords: | 05 C 38 05 C 40 |
| 本文献已被 SpringerLink 等数据库收录！ | |