- Published 2008 in Discrete Mathematics
DOI:10.1016/j.disc.2007.10.021

For a 2-factor F of a connected graph G, we consider G − F , which is the graph obtained from G by removing all the edges of F . If G − F is connected, F is said to be a non-separating 2-factor. In this paper we study a sufficient condition for a 2r -regular connected graph G to have such a 2-factor. As a result, we show that a 2r -regular connected graph G… CONTINUE READING

### Presentations referencing similar topics