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

Jun Fujisawa, Tomoki Yamashita

Research output: Contribution to journalArticle

2 Citations (Scopus)

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 languageEnglish
Pages (from-to)179-190
Number of pages12
JournalJournal of Graph Theory
Volume58
Issue number2
DOIs
Publication statusPublished - 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