Let b ⩾ 2 be an even integer and let G be a 2-edge-connected graph. If σ 2 ( G ) ⩾ max { 4 n / ( 2 + b ) , 5 } , then G has an even [ 2 , b ] -factor.

The main result is the following: a 2-edge-connected graph G of order n has an even [2,b]-factor if the degree sum of each pair of nonadjacent vertices in G is ...

which only gives a sufficient condition for G to contain an even [2,b]-factor. ... Kano, An Ore-type sufficient condition for a graph to have a connected. [2,k]- ...

In this paper, we show that a 2-edge-connected graph G of order n has an even [2, b]-factor if [...] max degG (x),degG (y)⩾max 2n2+b,3 for any nonadjacent ...

Abstract. For a graph G and even integers b ⩾ a ⩾ 2, a spanning subgraph F of. G such that a ⩽ degF (x) ⩽ b and degF (x) is even for all x ∈ V (F) is ...

For even b≥2, an even [2,b]-factor is a spanning subgraph each of whose degree is even between 2 and b. The main result is the following: a ...

Letk be a positive integer, and letG be a graph of ordern withn ≧ 4k − 5,kn even and minimum degree at leastk. We prove that if the degree sum of each pair ...

For each even integer b ≥ 2 we prove that a graph G with n vertices has an even [2, b]-factor if G is 2-edge connected and each vertex of G has degree at ...

It is proved that if the degree sum of each pair of nonadjacent vertices is at leastn, then G, the graph of ordern, has ak-factor.

We prove Ore-type conditions for graphs to have a 2-edge-connected [ a , b ] -factor.