Abstract
We give a strengthening of the closure concept for claw-free graphs introduced by the second author in 1997. The new closure of a claw-free graph G defined here is uniquely determined and preserves the value of the circumference of G. We present an infinite family of graphs with n vertices and 3/2n-1 edges for which the new closure is the complete graph Kn.
| Original language | English |
|---|---|
| Pages (from-to) | 55-63 |
| Number of pages | 9 |
| Journal | Discrete mathematics |
| Volume | 233 |
| Issue number | 1-3 |
| DOIs | |
| Publication status | Published - 2001 |
Fingerprint
Keywords
- METIS-201548
- Closure
- Claw-free graph
- Hamiltonian graph
- Circumference
- IR-74523
- Cycle closure
Cite this
Broersma, H. J., & Ryjacek, Z. (2001). Strengthening the closure concept in claw-free graphs. Discrete mathematics, 233(1-3), 55-63. https://doi.org/10.1016/S0012-365X(00)00226-0