Independent cycles with limited size in a graph |
| |
Authors: | Hong Wang |
| |
Affiliation: | 1. Department of Mathematics, Massey University, Palmerston North, New Zealand
|
| |
Abstract: | Letk and s be two positive integers with s≥3. LetG be a graph of ordern ≥sk. Writen =qk + r, 0 ≤r ≤k - 1. Suppose thatG has minimum degree at least (s - l)k. Then G containsk independent cyclesC 1,C 2,...,C k such thats ≤l(C i ) ≤q for 1 ≤i ≤r arnds ≤l(C i ) ≤q + 1 fork -r <i ≤k, where l(Ci) denotes the length ofC i . |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|