Curtis A. Barefoot

Curtis A. Barefoot: Block-cutvertex trees and block-cutvertex partitions. Discrete Mathematics 256(1-2): 35-54 (2002)

Curtis A. Barefoot, Roger C. Entringer, László A. Székely: Extremal Values for Ratios of Distances in Trees. Discrete Applied Mathematics 80(1): 37-56 (1997)

Curtis A. Barefoot, L. H. Clark, Roger C. Entringer, T. D. Porter, László A. Székely, Zsolt Tuza: Cycle-saturated graphs of minimum size. Discrete Mathematics 150(1-3): 31-48 (1996)

Curtis A. Barefoot, L. H. Clark, A. J. Depew, Roger C. Entringer, László A. Székely: Subdivision thresholds for two classes of graphs. Discrete Mathematics 125(1-3): 15-30 (1994)

Curtis A. Barefoot: Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size. Discrete Mathematics 49(2): 109-112 (1984)