On the Existence of Disjoint Cycles in a Graph

Combinatorica volume 18, pages487–492(1998)Cite this article

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.

Access options

Buy single article

Instant access to the full article PDF.

US$ 39.95

Tax calculation will be finalised during checkout.

Author information

Affiliations

  1. Department of Mathematics, Keio University; Yokohama 223–8522, Japan; E-mail: enomoto@math.keio.ac.jp, JP

    Hikoe Enomoto

Authors
  1. Hikoe Enomoto
    View author publications

    You can also search for this author in PubMed Google Scholar

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