Skip to main content
Log in

Vertex-Disjoint Cycles Containing Specified Edges

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

Dirac and Ore-type degree conditions are given for a graph to contain vertex disjoint cycles each of which contains a previously specified edge. One set of conditions is given that imply vertex disjoint cycles of length at most 4, and another set of conditions are given that imply the existence of cycles that span all of the vertices of the graph (i.e. a 2-factor). The conditions are shown to be sharp and give positive answers to conjectures of Enomoto in [3] and Wang in [5].

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Revised: July 28, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Egawa, Y., Faudree, R., Györi, E. et al. Vertex-Disjoint Cycles Containing Specified Edges. Graphs Comb 16, 81–92 (2000). https://doi.org/10.1007/s003730050005

Download citation

  • Issue Date:

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

Navigation