1. A generalization of a result of Häggkvist and Nicoghossian
2. “Basic graph theory—Paths and cycles,” Handbook of Combinatorics, Vol. I, Elsevier, Amsterdam, 1995, pp. 5–110.
3. Cycles through subsets with large degree sums
4. A note on Hamiltonian circuits
5. and , “Longest cycles and independent sets in k-connected graphs,” Recent Studies in Graph Theory, (Editor), Vischwa Internat. Publ. Gulbarga, India, 1989, pp. 114–139.