Vertex-disjoint cycles containing specified edges

被引：42

作者：

Egawa, Y ^{[1
]}

Faudree, RJ

Györi, E

Ishigami, Y

Schelp, RH

Wang, H

机构：

[1] Sci Univ Tokyo, Dept Appl Math, Shinjuku Ku, Tokyo 1628601, Japan

[2] Memphis State Univ, Dept Math Sci, Memphis, TN 38152 USA

[3] Hungarian Acad Sci, Renyi Inst Math, H-1364 Budapest, Hungary

[4] Univ Electrocommun, Dept Informat & Commun Engn, Tokyo 1828585, Japan

[5] Univ Idaho, Dept Math, Moscow, ID 83844 USA

来源：

GRAPHS AND COMBINATORICS | 2000年 / 16卷 / 01期

关键词：

cover; cycle; partition; 2-factor;

D O I：

10.1007/s003730050005

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Dirac and Ore-type degree conditions are given for a graph to contain vertex disjoint cycles each of which contains a previously specified edge. One set of conditions is given that imply vertex disjoint cycles of length at most 4, and another set of conditions are given that imply the existence of cycles that span all of the vertices of the graph (i.e. a 2-factor). The conditions are shown to be sharp and give positive answers to conjectures of Enomoto in [3] and Wang in [5].

引用

页码：81 / 92

页数：12