On 2-edge-connected image-factors of graphs with Ore-type condition Original Research Article

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