1. , and , Graphs and Digraphs. Prindle, Weber and Schmidt, Boston (1979)
2. The number of homeomorphically irreducible trees, and other species
3. and , Computers and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., San Francisco (1979).
4. London Mathem;Hill,1974
5. Spanning forests with given radius and few components. Preprint.