A graph G is k-covered if each edge of G belongs to a k-factor of G. We determine some valuee of k for which every r-regular graph with edge-connectivity λ is
In this paper, we use the concentration-compactness principle together with the Mountain Pass Lemma to get the existence of nontrivial solutions and the existen