  In the present work we prove that given any two unicycle graphs
(pseudoforests)
  that share the same degree sequence there is a finite sequence of 2-switches
  transforming one into the other such that all the graphs in the sequence
  are also unicyclic graphs (pseudoforests).
