Abstract

Let a ⩾ 2 and t ⩾ 2 be two integers. Suppose that G is a 2-edge-connected graph of order | G | ⩾ 2 ( t + 1 ) ( ( a - 2 ) t + a ) + t - 1 with minimum degree at least a. Then G has a 2-edge-connected [ a , at ] -factor if every pair of non-adjacent vertices has degree sum at least 2 | G | / ( 1 + t ) . This lower bound is sharp. As a consequence, we have Ore-type conditions for the existence of a 2-edge-connected [ a , b ] -factor in graphs.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call