On graphs with equal edge-connectivity and minimum degree. - Donald L. Goldsmith; Arthur T. White (Discret. Math., 1978)

A sufficient condition for equality of edge-connectivity and minimum degree of a graph. - Donald L. Goldsmith; Roger C. Entringer (J. Graph Theory, 1979)

Separation of graphs into three components by the removal of edges. - Donald L. Goldsmith; Bennet Manvel; Vance Faber (J. Graph Theory, 1980)

Indestructive deletions of edges from graphs. - Béla Bollobás; Donald L. Goldsmith; Douglas R. Woodall (J. Comb. Theory B, 1981)