Vertex-disjoint chorded cycles in a graph

  • Authors:

  • Shengning Qiao;Shenggui Zhang

  • Affiliations:

  • Department of Applied Mathematics, Xidian University, Xi'an, Shaanxi 710071, PR China;Department of Applied Mathematics, Northwestern Polytechnical University, Xi'an, Shaanxi 710072, PR China

  • Venue:
  • Operations Research Letters
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we prove: Let k=1 be an integer and G be graph with at least 4k vertices and minimum degree at least @?7k/2@?. Then G contains k vertex-disjoint cycles such that each of them has at least two chords in G.