### 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 |

### Keywords

- Cyclable
- Long cycle
- Minimum degree

### ASJC Scopus subject areas

- Geometry and Topology

## Fingerprint Dive into the research topics of 'Cycles passing through k + 1 vertices in k-connected graphs'. Together they form a unique fingerprint.

## Cite this

Fujisawa, J., & Yamashita, T. (2008). Cycles passing through k + 1 vertices in k-connected graphs.

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