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].
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Revised: July 28, 1999
Rights 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
Issue Date:
DOI: https://doi.org/10.1007/s003730050005