Abstract.
Let s≥2 and k be two positive integers. Let G=(V 1,V 2;E) be a bipartite graph with |V 1|=|V 2|=n≥s k and the minimum degree at least (s−1)k+1. When s=2 and n >2k, it is proved in [5] that G contains k vertex-disjoint cycles. In this paper, we show that if s≥3, then G contains k vertex-disjoint cycles of length at least 2s.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: March 2, 1998 Revised: October 26, 1998
Rights and permissions
About this article
Cite this article
Wang, H. Large Vertex-Disjoint Cycles in a Bipartite Graph. Graphs Comb 16, 359–366 (2000). https://doi.org/10.1007/s003730070017
Issue Date:
DOI: https://doi.org/10.1007/s003730070017