Skip to main content
SpringerLink
Log in

On the Existence of Disjoint Cycles in a Graph

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

G

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

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and 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

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004930050034

Search

Navigation