1. J. Battle, F. Harary, and Y. Kodama, Every planar graph with nine points has a non-planar complement. Bull. Amer. Math. Soc. 68 (1962), 569–571.
2. L.W. Beineke, Decompositions of complete graphs into forests. Publ. Math. Inst. Hungar. Acad. Sci. 9 (1964), 589–594.
3. L.W. Beineke, Complete bipartite graphs: Decomposition into planar subgraphs. Chapter in A Seminar on Graph Theory, F. Harary, Ed. Holt, Rinehart and Winston, New York, 1967, pp. 42–53.
4. L.W. Beineke, The decomposition of complete graphs into planar subgraphs. Chapter in Graph Theory and Theoretical Physics, F. Harary, Ed. Academic Press, London, 1967, pp. 139–153.
5. L.W. Beineke, Minimal decompositions of complete graphs into subgraphs with embeddability properties. Canad. J. Math. 21 (1969). (to appear)