Approximating the circumference of 3-connected claw-free graphs
Jackson and Wormald show that every 3-connected K_1,d-free graph, on n vertices, contains a cycle of length at least 1/2 n^g(d) where g(d) = (log_2 6 + 2 log_2 (2d+1))^-1. For d = 3, g(d) ~ 0.122. Improving this bound, we prove that if G is a 3-connected claw-free graph on at least 6 vertices, then...
| Main Author: | |
|---|---|
| Published: |
Georgia Institute of Technology
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/26516 |