Hybrid programs: Linear and least-distance. - Torrence D. Parsons; Albert W. Tucker (Math. Program., 1971)

The Ramsey numbers r(Pm, Kn). - Torrence D. Parsons (Discret. Math., 1973)

Path-cycle Ramsey numbers. - Ralph J. Faudree; S. L. Lawrence; Torrence D. Parsons; Richard H. Schelp (Discret. Math., 1974)

Ramsey Graphs and Block Designs. - Torrence D. Parsons (J. Comb. Theory A, 1976)

Paths extendable to cycles. - Torrence D. Parsons (J. Graph Theory, 1978)

Isomorphism of circulant graphs and digraphs. - Brian Alspach; Torrence D. Parsons (Discret. Math., 1979)

Dual imbeddings and wrapped quasi-coverings of graphs. - Torrence D. Parsons; Tomaz Pisanski; Brad Jackson (Discret. Math., 1980)

Circulant graph imbeddings. - Torrence D. Parsons (J. Comb. Theory B, 1980)

A duality theorem for graph embeddings. - Brad Jackson; Torrence D. Parsons; Tomaz Pisanski (J. Graph Theory, 1981)

Hamiltonian paths in vertex-symmetric graphs of order 5p. - Dragan Marusic; Torrence D. Parsons (Discret. Math., 1982)

Longest cycles in r-regular r-connected graphs. - Brad Jackson; Torrence D. Parsons (J. Comb. Theory B, 1982)

A shortness exponent for r-regular r-connected graphs. - Brad Jackson; Torrence D. Parsons (J. Graph Theory, 1982)

Hamiltonian paths in vertex-symmetric graphs of order 4p. - Dragan Marusic; Torrence D. Parsons (Discret. Math., 1983)

Embeddings of bipartite graphs. - Mohammed Abu-Sbeih; Torrence D. Parsons (J. Graph Theory, 1983)

Intersection Graphs for Families of Balls in Rn. - Paul Erdös; Chris D. Godsil; Steven G. Krantz; Torrence D. Parsons (Eur. J. Comb., 1988)

Exotic n-universal graphs. - Torrence D. Parsons; Tomaz Pisanski (J. Graph Theory, 1988)

Vector representations of graphs. - Torrence D. Parsons; Tomaz Pisanski (Discret. Math., 1989)