G
is a graph of order at least 3k with . Then G contains k vertex-disjoint cycles.
Article PDF
Similar content being viewed by others
Use our pre-submission checklist
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received: April 23, 1998
Rights and permissions
About this article
Cite this article
Enomoto, H. On the Existence of Disjoint Cycles in a Graph. Combinatorica 18, 487–492 (1998). https://doi.org/10.1007/s004930050034
Issue Date:
DOI: https://doi.org/10.1007/s004930050034