Disjoint long cycles in a graph

被引：0

作者：

Hong Wang

机构：

[1] The University of Idaho,Department of Mathematics

来源：

Science China Mathematics | 2013年 / 56卷

关键词：

cycles; disjoint cycles; long cycles; 05C38; 05C70; 05C75;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We prove that if G is a graph of order at least 2k with k ⩾ 9 and the minimum degree of G is at least k + 1, then G contains two vertex-disjoint cycles of order at least k. Moreover, the condition on the minimum degree is sharp.

引用

页码：1983 / 1998

页数：15

共 17 条

[1]

Reis C. M.(1978)Some properties of disjunctive languages on a free monoid Inform Contr 37 334-344

[2]

Shyr H. J.(1971)Pancyclic graphs I J Combin Theory Ser B 11 80-84

[3]

Bondy J.(1976)A method in graph theory Discrete Math 15 111-135

[4]

Bondy J.(1963)On the maximal number of independent circuits in a graph Acta Math Acad Sci Hungar 14 423-439

[5]

Chvátal V.(1952)Some theorems on abstract graphs Proc London Math Soc 2 69-81

[6]

Corrádi K.(1991)Cycles and paths through specified vertices in J Combin Theory Ser B 52 20-29

[7]

Hajnal A.(1984)-connected graphs Discrete Math 50 227-230

[8]

Dirac G. A.(1959)On circuits in graphs Acta Math Acad Sci Hungar 10 337-356

[9]

Egawa Y.(1960)On maximal paths and circuits of graphs Amer Math Monthly 67 55-281

[10]

Glas R.(1994)Note on Hamilton circuits Graphs Combin 10 271-396

← 1 2 →