1. , and , The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA (1974).
2. Paths, Trees, and Flowers
3. private communication (1977).
4. The directed subgraph homeomorphism problem
5. and , Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco (1979).