Abstract
Let r and s be nonnegative integers, and let G be a graph of order at least 3r + 4s. In Bialostocki et al. (Discrete Math 308:5886–5890, 2008), conjectured that if the minimum degree of G is at least 2r + 3s, then G contains a collection of r + s vertex-disjoint cycles such that s of them are chorded cycles, and they showed that the conjecture is true for r = 0, s = 2 and for s = 1. In this paper, we settle this conjecture completely by proving the following stronger statement; if the minimum degree sum of two nonadjacent vertices is at least 4r + 6s−1, then G contains a collection of r + s vertex-disjoint cycles such that s of them are chorded cycles.
Similar content being viewed by others
References
Bialostocki A., Finkel D., Gyárfás A.: Disjoint chorded cycles in graphs. Discret. Math. 308, 5886–5890 (2008)
Corrádi K., Hajnal A.: On the maximal number of independent circuits in a graph. Acta Math. Acad. Sci. Hungar. 14, 423–439 (1963)
Enomoto H.: On the existence of disjoint cycles in a graph. Combinatorica 18, 487–492 (1998)
Finkel D.: On the number of independent chorded cycle in a graph. Discret. Math. 308, 5265–5268 (2008)
Pósa L.: On the circuits of finite graphs. Magyar Tud. Akad. Mat. Kut. Int. Közl. 8, 355–361 (1964)
Wang H.: On the maximum number of independent cycles in a graph. Discret. Math. 205, 183–190 (1999)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chiba, S., Fujita, S., Gao, Y. et al. On a Sharp Degree Sum Condition for Disjoint Chorded Cycles in Graphs. Graphs and Combinatorics 26, 173–186 (2010). https://doi.org/10.1007/s00373-010-0901-5
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-010-0901-5