1. Paths, Trees, and Flowers
2. Maximum matching and a polyhedron with 0,1-vertices
3. and , Matching: A well-solved class of integer linear programs. In Combinatorial Structures and their Applications, et al., Eds. Gordon and Breach, New York (1970), pp. 89–92.
4. Matching, Euler tours and the Chinese postman
5. Matching polyhedra. M.Sc. Thesis, Carleton University, 1980.