Disjoint triangles and quadrilaterals in a graph
- 34 Downloads
Let n, s and t be three integers with s ≥ 1, t ≥ 0 and n = 3s + 4t. Let G be a graph of order n such that the minimum degree of G is at least (n + s)/2. Then G contains a 2-factor with s + t components such that s of them are triangles and t of them are quadrilaterals.
Keywordscover cycle factor
Unable to display preview. Download preview PDF.