Connected even factors in {K-1,K-l, K-1,K-l + e}-free graphs

摘要

A connected factor F of a graph G is a connected spanning subgraph of G. If the degree of each vertex in F is an even number between 2 and 2s, then F is a connected even [2, 2s]-factor of G, where s is an integer. In this paper, we show that every supereulerian {K-1,K-l+1, K-1,K-l+1 + e}-free graph (l >= 2) contains a connected even [2, 2l - 2]-factor.