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.
机构:
Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R ChinaShandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China
Jiang, Suyun
Chiba, Shuya
论文数: 0引用数: 0
h-index: 0
机构:
Kumamoto Univ, Fac Adv Sci & Technol, Appl Math, 2-39-1 Kurokami, Kumamoto 8608555, JapanShandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China
Chiba, Shuya
Fujita, Shinya
论文数: 0引用数: 0
h-index: 0
机构:
Yokohama City Univ, Int Coll Arts & Sci, Kanazawa Ku, 22-2 Seto, Yokohama, Kanagawa 2360027, JapanShandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China
Fujita, Shinya
Yan, Jin
论文数: 0引用数: 0
h-index: 0
机构:
Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R ChinaShandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China