On 2-Factors with Chorded Quadrilaterals in Graphs

摘要

Let k be a positive integer and G a graph with order n >= 4k + 3. It is proved that if the minimum degree sum of any two nonadjacent vertices is at least n + k, then G contains a 2-factor with k + 1 disjoint cycles, C-1,C- ..., C-k+i such that C-i are chorded quadrilateral for 1 <= i <= k - 1 and the length of C-k is at most 4.