Ore-type conditions implying 2-factors consisting of short cycles


For every graph G, let σ2(G) = min{d(x)+ d(y) : xy 6∈ E(G)}. The main result of the paper says that everyn-vertex graphGwithσ2(G) ≥ 4n 3 −1 contains each spanning subgraphH all whose components are isomorphic to graphs in {K1, K2, C3, K 4 , C + 5 }. This generalizes the earlier results of Justesen, Enomoto, andWang, and is a step towards an Ore-type… (More)
DOI: 10.1016/j.disc.2008.06.001

1 Figure or Table


  • Presentations referencing similar topics