A Different 2-factor in a graph We know that a k-factor of G is a k-regular spanning subgraph of G. And if G is 4-regular (or 2k-regular), it can be partitioned into 2 (k) edge-disjoint 2-factors (Petersen 1891).
My question is in a graph G with $\delta \geq 4$ which already has a 2-factor, can we say it has another 2-factor (different in at least one edge, not distinct)?
 A: According to this source, a graph with a unique 2-factor must have a degree-two vertex. The result is credited to
Jackson, Bill; Whitty, R. W. (1989), "A note concerning graphs with unique $f$-factors", J. Graph Theory 13 (5): 577–580, doi:10.1002/jgt.3190130507.
However I don't have subscription access to that paper to verify that it really says that. So anyway, yes, if this is all accurate, then graphs with $\delta\ge 3$ have a second 2-factor when they have one.
Added later: see comments below. Apparently when Handbook of Graph Theory quoted this result, they omitted an additional assumption required for this result, that the graph be 2-edge-connected. This is why one needs to check original sources.
A: This proof is credited to Kamyar Khosravi.
We can orient the edges of graph $G$ such that $d_G^-(v), d_G^+(v)\geq 2$ for each $v\in V(G)$ and any cycle of the given 2-factor $F$ will become directed cycles. (We just orient the cycles of the given 2-factor and then orient the remaining edges, using one (or some) eulerian circuit for $v+G\backslash E(F)$ which $v$ is a new vertex connected to odd vertices of G).
Then we construct a bipartite graph $H$, each part $X$ and $Y$ having a copy of $V(G)$ and for any directed edge $e=uv$ in directed version of $G$ we add an edge from $u_X$ to $v_Y$. Each matching in H corresponds to a directed 2-factor in directed G. So by using edges of F, we can say H has a matching and satisfy Hall's condition. Then by an extended version of Hall's Theorem, we can say H has at least $\delta(X)!$ (if $\delta(X) < |X|$) which is $2!$ or simply $2$. So $G$ has at least two 2-factos. $\blacksquare$
For the case of $\delta(G)=3$ we can construct a counterexample graph with 18 vertices shown below. This graph has a cut edge $e=uv$, thus $e$ cannot be in any 2-factor. $u$ and $v$ must be in a triangle. We can then say other cycles of 2-factor are uniquely determined.

