1. C. Berge,Graphes (Dunod, Paris, 1983).
2. J. Folkman and D.R. Fulkerson, “Edge colorings in bipartite graphs,” in: R.C. Bose and T.A. Dowling, eds.,Combinatorial Mathematics and their Applications (University of North Carolina Press, Chapel Hill, 1969) pp. 561–577.
3. L.R. Ford and D.R. Fulkerson,Flows in Networks (Princeton University Press, Princeton, NJ, 1962).
4. R.Z. Norman and M.O. Rabin, “An algorithm for a minimum cover of a graph,”Proceedings of the American Mathematical Society 10 (1959) 315–319.
5. W.R. Pulleyblank and D. de Werra, “Odd chain packings,” to appear inEuropean Journal of Combinations.