1. and , Computers and intractability. A guide to the theory of NP-completeness. Freeman, San Francisco (1979).
2. ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
3. Coverings and colorings of hypergraphs. In Proceedings, 4th Southeastern Conference on Combinatorics, Graph Theory and Computing. Utilitas Mathematica, Winnipeg (1973) 3–12.