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

Authors
Ishigami, Y
Citation
Y. Ishigami, Vertex-disjoint cycles of length at most four each of which contains a specified vertex, J GRAPH TH, 37(1), 2001, pp. 37-47
Citations number
5
Categorie Soggetti
Mathematics
Journal title
JOURNAL OF GRAPH THEORY
ISSN journal
03649024 → ACNP
Volume
37
Issue
1
Year of publication
2001
Pages
37 - 47
Database
ISI
SICI code
0364-9024(200105)37:1<37:VCOLAM>2.0.ZU;2-Q
Abstract
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 g raph 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 fo ur each of which contains one of the k prescribed vertices. (C) 2001 John W iley & Sons, Inc.