Abstract.
Let G=(V 1,V 2;E) be a bipartite graph with 2k≤m=|V 1|≤|V 2|=n, where k is a positive integer. We show that if the number of edges of G is at least (2k−1)(n−1)+m, then G contains k vertex-disjoint cycles, unless e(G)=(2k−1)(n−1)+m and G belongs to a known class of graphs.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: December 9, 1998 Final version received: June 2, 1999
Rights and permissions
About this article
Cite this article
Wang, H. On Independent Cycles in a Bipartite Graph. Graphs Comb 17, 177–183 (2001). https://doi.org/10.1007/s003730170065
Issue Date:
DOI: https://doi.org/10.1007/s003730170065