✦ LIBER ✦
Long Cycles and 3-Connected Spanning Subgraphs of Bounded Degree in 3-Connected K1, d-Free Graphs
✍ Scribed by B. Jackson; N.C. Wormald
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 238 KB
- Volume
- 63
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
✦ Synopsis
Let (G) be a 3-connected (K_{1, d})-free graph on (n) vertices. We show that (G) contains a 3-connected spanning subgraph of maximum degree at most (2 d-1). Using an earlier result of ours, we deduce that (G) contains a cycle of length at least (\frac{1}{2} n^{c}) where (c=\left(\log _{2} 6+2 \log _{2}(2 d-1)\right)^{-1}). 1945 Academic Press. Inc.