On the Existence of Disjoint Cycles in a Graph

G

is a graph of order at least 3k with . Then G contains k vertex-disjoint cycles.

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Additional information

Received: April 23, 1998

Rights and permissions

Reprints 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

Download citation

  • AMS Subject Classification (1991) Classes:  05C38, 05C70