1. D. Archdeacon, Double Covering Edges by Perfect Matchings. Web address: http://www.cems.uvm.edu/~archdeac/problems/fulker.htm
2. Shortest coverings of graphs with cycles;Bermond;J. Combin. Theory Ser. B.,1983
3. Graph Theory with Applications;Bondy,1976
4. The rise and fall of the critical graph conjecture;Chetwynd;J. Graph Theory,1983
5. M. DeVos, The Berge–Fulkerson conjecture. Web address: http://garden.irmacs.sfu.ca/?q=op/the_berge_fulkerson_conjecture