David M. Berman

All trees contain a large induced subgraph having all degrees 1 (mod k)

Hong Wang, Alex D. Scott, A. J. Radcliffe, 1997, Discret. Math..

The chromatic difference sequence of a graph

Michael O. Albertson, David M. Berman, 1980, J. Comb. Theory, Ser. B.

The number of cut-vertices in a graph of given minimum degree

Michael O. Albertson, David M. Berman, 1991, Discret. Math..

Odd induced subgraphs in graphs of maximum degree three

Hong Wang, David M. Berman, Larry Wargo, 1997, Australas. J Comb..

Critical graphs for chromatic difference sequences

Michael O. Albertson, David M. Berman, 1980, Discret. Math..

Induced stars in trees

Hong Wang, David M. Berman, Larry Wargo, 1998, Australas. J Comb..

Graphs with homeomorphically irreducible spanning trees

Carsten Thomassen, Michael O. Albertson, Joan P. Hutchinson, 1990, J. Graph Theory.

Critical Graphs for Acyclic Colorings

David M. Berman, D. M. Berman, 1978, Canadian Mathematical Bulletin.