### Abstract

In this article, we prove the following theorem. Let k ≥ 3 be an integer, G be a k-connected graph with minimum degree d and X be a set of k+ 1 vertices on a cycle. Then G has a cycle of length at least min{2d,

Original language | English |
---|---|

Pages (from-to) | 179-190 |

Number of pages | 12 |

Journal | Journal of Graph Theory |

Volume | 58 |

Issue number | 2 |

DOIs | |

Publication status | Published - 2008 Jun |

Externally published | Yes |

### Fingerprint

### Keywords

- Cyclable
- Long cycle
- Minimum degree

### ASJC Scopus subject areas

- Mathematics(all)

### Cite this

*Journal of Graph Theory*,

*58*(2), 179-190. https://doi.org/10.1002/jgt.20306

**Cycles passing through k + 1 vertices in k-connected graphs.** / Fujisawa, Jun; Yamashita, Tomoki.

Research output: Contribution to journal › Article

*Journal of Graph Theory*, vol. 58, no. 2, pp. 179-190. https://doi.org/10.1002/jgt.20306

}

TY - JOUR

T1 - Cycles passing through k + 1 vertices in k-connected graphs

AU - Fujisawa, Jun

AU - Yamashita, Tomoki

PY - 2008/6

Y1 - 2008/6

N2 - In this article, we prove the following theorem. Let k ≥ 3 be an integer, G be a k-connected graph with minimum degree d and X be a set of k+ 1 vertices on a cycle. Then G has a cycle of length at least min{2d,

AB - In this article, we prove the following theorem. Let k ≥ 3 be an integer, G be a k-connected graph with minimum degree d and X be a set of k+ 1 vertices on a cycle. Then G has a cycle of length at least min{2d,

KW - Cyclable

KW - Long cycle

KW - Minimum degree

UR - http://www.scopus.com/inward/record.url?scp=44649203381&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=44649203381&partnerID=8YFLogxK

U2 - 10.1002/jgt.20306

DO - 10.1002/jgt.20306

M3 - Article

AN - SCOPUS:44649203381

VL - 58

SP - 179

EP - 190

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 2

ER -