Vertex-Disjoint Cycles of the Same Lengt
β
Yoshimi Egawa
π
Article
π
1996
π
Elsevier Science
π
English
β 1015 KB
We show that for each integer k 3, there exists an integer p k such that every graph with minimum degree at least 2k and order at least p k contains k pairwise vertex-disjoint cycles of the same length.