Article contents
Cyclability of r-regular r-connected graphs
Published online by Cambridge University Press: 17 April 2009
Abstract
For each value of r ≥ 4, r even, we construct infinitely many r-regular, r-connected graphs whose cyclability is not greater than 6r − 4 if r = 0 (mod 4) and 8r − 5 if r ≡ 2 (mod 4).
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1984
References
- 5
- Cited by