8 citations · 14 across the 5 of their papers we have counts for
1 paper · 1 filter
H. A. Kierstead, A. V. Kostochka, E. C. Yeager
In 1963, Corrádi and Hajnal proved that for all k≥1 and n≥3k, every graph G on n vertices with minimum degree δ(G)≥2k contains k disjoint cycles. The bound $δ(…