1. Uncrossing a family of set-pairs;Fleiner;Combinatorica,2001
2. Minimal edge-coverings of pairs of sets;Frank;J. Combin. Theory Ser. B,1995
3. J. Geelen, The C6-free 2-factor problem in bipartite graphs is NP-complete, oral communication, December 1999.
4. The square-free 2-factor problem in bipartite graphs;Hartvigsen,1999
5. D. Hartvigsen, Finding maximum square-free 2-matchings in bipartite graphs, September 2000, manuscript (detailed and improved version of [4]).