Premium
Vertex‐disjoint cycles of length at most four each of which contains a specified vertex *
Author(s) -
Ishigami Yoshiyas
Publication year - 2001
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.1002
Subject(s) - combinatorics , mathematics , vertex (graph theory) , disjoint sets , neighbourhood (mathematics) , graph , order (exchange) , discrete mathematics , mathematical analysis , finance , economics
We obtain a sharp minimum degree condition δ (G) ≥ $\lfloor {\sqrt {\phantom{n^2}n+k^2-3k+1}}\rfloor + 2k-1$ of a graph G of order n ≥ 3 k 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. © 2001 John Wiley & Sons, Inc. J Graph Theory 37: 37–47, 2001