Question:

what can be said about the existence of $2k$ regular graphs, $1\lt k$ that have a $1$-factor and a $2$-factor?

Provided their existence, what is/are the smallest for $k$?

The graphs must be simple, i.e. they must not neither have self-loops nor multiple edges.