Extremal maximal uniquely hamiltonian graphs. - Curtis A. Barefoot; Roger C. Entringer (J. Graph Theory, 1980)

A census of maximum uniquely hamiltonian graphs. - Curtis A. Barefoot; Roger C. Entringer (J. Graph Theory, 1981)

Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size. - Curtis A. Barefoot (Discret. Math., 1984)

Subdivision thresholds for two classes of graphs. - Curtis A. Barefoot; Lane H. Clark; A. J. Depew; Roger C. Entringer; László A. Székely (Discret. Math., 1994)

Cycle-saturated graphs of minimum size. - Curtis A. Barefoot; Lane H. Clark; Roger C. Entringer; T. D. Porter; László A. Székely; Zsolt Tuza (Discret. Math., 1996)

Extremal Values for Ratios of Distances in Trees. - Curtis A. Barefoot; Roger C. Entringer; László A. Székely (Discret. Appl. Math., 1997)

Block-cutvertex trees and block-cutvertex partitions. - Curtis A. Barefoot (Discret. Math., 2002)