Vertex-disjoint cycles of length at most four each of which contains a specified vertex

被引：0

作者：

Ishigami, Y ^{[1
]}

机构：

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

[2] Univ Illinois, Dept Math, Urbana, IL 61801 USA

来源：

JOURNAL OF GRAPH THEORY | 2001年 / 37卷 / 01期

关键词：

cycle; quadrilateral; degree;

D O I：

10.1002/jgt.1002

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We obtain a sharp minimum degree condition delta (G) greater than or equal to right perpendicular rootn+k2 - 3k + 1 left perpendicular + 2k - 1 of a graph G of order n greater than or equal to 3k guaranteeing that, for any k distinct vertices, G contains k vertex-disjoint cycles of length at most four each of which contains one of the k prescribed vertices. (C) 2001 John Wiley & Sons, Inc.

引用

页码：37 / 47

页数：11