Independent cycles with limited size in a graph
The following generalization of a result of \textit{K. Corrádi} and \textit{A. Hajnal} [Acta Math. Acad. Sci. Hung. 14, 423-439 (1963; Zbl 0118.190)] is proved. Let \(k\) and \(s\) be two positive integers with \(s\geq 3\). Let \(G\) be a graph of order \(n\geq sk\) and define \(q\) and \(r\) by \(n= qk+ r\), \(0\leq r\leq k-1\). Then, if \(G\) has minimum degree at least \((s- 1)k\), it contains \(k\) independent cycles \(C_ 1, C_ 2,\dots, C_ k\) such that the length of \(C_ i\) is inclusively between \(s\) and \(q\) for \(1\leq i\leq k- r\) and inclusively between \(s\) and \(q+ 1\) for \(k- r< i\leq k\).
- On quadrilaterals in a graph
- On the maximum number of independent cycles in a graph
- Triangles in claw-free graphs
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Disjoint long cycles in a graph
- scientific article; zbMATH DE number 749260 (Why is no real title available?)
- scientific article; zbMATH DE number 841612 (Why is no real title available?)
- Partial Degree Conditions and Cycle Coverings
- On circuits in graphs
This page was built for publication: Independent cycles with limited size in a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1340129)
