On a clique covering problem of orlin. - David A. Gregory; Norman J. Pullman (Discret. Math., 1982)

Clique partitions of the cocktail party graph. - David A. Gregory; Sean McGuinness; Walter D. Wallis (Discret. Math., 1986)

Factorizations of symmetric designs. - Dominique de Caen; David A. Gregory (J. Comb. Theory A, 1988)

Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices. - David A. Gregory; Norman J. Pullman; Kathryn Fraughnaugh Jones; J. Richard Lundgren (J. Comb. Theory B, 1991)

Directed Moore Hypergraphs. - Fahir Ö. Ergincan; David A. Gregory (Discret. Appl. Math., 1995)

Sharp bounds for decompositions of graphs into complete r-partite subgraphs. - David A. Gregory; Kevin N. Vander Meulen (J. Graph Theory, 1996)

Decompositions of Complete Multigraphs Related to Hadamard Matrices. - David A. Gregory; Kevin N. Vander Meulen (J. Comb. Theory A, 1998)

Exponents of vertex-transitive digraphs. - Jian Shen; David A. Gregory (Discret. Math., 2000)

On the Girth of Digraphs with High Connectivity. - Jian Shen; David A. Gregory (Ars Comb., 2001)

Addressing the Petersen graph. - Randall J. Elzinga; David A. Gregory; Kevin N. Vander Meulen (Electron. Notes Discret. Math., 2002)

Inertia and biclique decompositions of joins of graphs. - David A. Gregory; Brenda Heyink; Kevin N. Vander Meulen (J. Comb. Theory B, 2003)

Extreme eigenvalues of nonregular graphs. - Sebastian M. Cioaba; David A. Gregory; Vladimir Nikiforov 001 (J. Comb. Theory B, 2007)

Clique partitions of distance multigraphs. - Michael S. Cavers; Randall J. Elzinga; David A. Gregory; Sarah E. Vanderlinde; Kevin N. Vander Meulen (Discret. Math., 2008)

Matchings in regular graphs from eigenvalues. - Sebastian M. Cioaba; David A. Gregory; Willem H. Haemers (J. Comb. Theory B, 2009)

Some observations on the smallest adjacency eigenvalue of a graph. - Sebastian M. Cioaba; Randall J. Elzinga; David A. Gregory (Discuss. Math. Graph Theory, 2020)