1. Appel, K. and Haken, W., An avoidable set of configurations,J. Comb. Theory,B26 (1979), 1–21.
2. Brooks, R. L., Smith, C. A. B., Stone, A. H. and Tutte, W. T., The dissection of rectangles into squares,Dvke Math. J.,7 (1940), 312–340.
3. Edmonds, J., Paths, trees, and flowers,Canad. J. Math.,17 (1965), 449–167.
4. Ford, L. R., Jr. and Fulkerson, D. R., A simple algorithm for finding maximal network flows and an application to the Hitchcock problem,Canad. J. Math.,9 (1957), 210–218.
5. Guan, M. G., An improvement of the graphic method,Acta Math. Sinica,10 (1960), 265–274.