A $2$-factor of the complete graph is a spanning subgraph whose components are cycles. A $2$-factor is called reverse if it has an involutory automorphism fixing exactly one vertex.
In this talk we show how the concept of a graceful labeling, introduced by Alex Rosa in 1967, can be used along with other tools to construct factorizations of the complete graph into copies of a reverse $2$-factor $F$ provided that a suitable cycle of $F$ is big enough, thus almost completely solving the Oberwolfach problem for reverse $2$-factors. This is joint work with Andrea Burgess and Peter Danziger.