1. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (North-Holland, New York).
2. An O(n2.5) algorithm for maximum matching in general graphs;Even;Proc. 16th Annual IEEE Symp. on Foundations of Computer science,1975
3. M.R. Garey and D.S. Johnson, Computers and Intractability (Freeman, San Francisco).
4. An n5/ algorithm for maximum matching in bipartite graphs;Hopcroft;SIAM J. Comput.,1973
5. Maximum matchings and trees;Savage;Inform. Process. Lett.,1980