1. Longest paths and cycles in graphs of high degree. CORR 80–16, Department of Combinatorics, Waterloo.
2. Long dominating cycles and paths in graphs with large neighborhood unions
3. Some Theorems on Abstract Graphs
4. , , and , Degree sums and covering cycles. Manuscript (1990).
5. , and , Graphs of order n with minimum degree at least n/3. University of Tokyo Technical Report 87–20.