Vertex-disjoint chorded cycles in a graph

被引：5
|
作者：
Qiao, Shengning [1 ]
Zhang, Shenggui [2 ]
机构：
[1] Xidian Univ, Dept Appl Math, Xian 710071, Shaanxi, Peoples R China
[2] NW Polytech Univ, Dept Appl Math, Xian 710072, Shaanxi, Peoples R China
来源：
OPERATIONS RESEARCH LETTERS | 2010年 / 38卷 / 06期
关键词：
Chord; Vertex disjoint; Minimum degree;
D O I：
10.1016/j.orl.2010.09.007
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
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 left perpendicular7k/2jright perpendicular. Then G contains k vertex-disjoint cycles such that each of them has at least two chords in G. Crown Copyright (C) 2010 Published by Elsevier B.V. All rights reserved.
引用
收藏
页码：564 / 566
页数：3
相关论文
共 50 条
12345