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)

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

Decompositions of complete multigraphs derived from Hadamard matrices. - Katrina J. Geertsema; Kevin N. Vander Meulen (J. Comb. Theory A, 2003)

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

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

Independence Complexes of Well-Covered Circulant Graphs. - Jonathan Earl; Kevin N. Vander Meulen; Adam Van Tuyl (Exp. Math., 2016)

Shellability, vertex decomposability, and lexicographical products of graphs. - Kevin N. Vander Meulen; Adam Van Tuyl (Contributions Discret. Math., 2017)

Addressing graph products and distance-regular graphs. - Sebastian M. Cioaba; Randall J. Elzinga; Michelle Markiewitz; Kevin N. Vander Meulen; Trevor Vanderwoerd (Discret. Appl. Math., 2017)

Shedding vertices of vertex decomposable well-covered graphs. - Jonathan Baker; Kevin N. Vander Meulen; Adam Van Tuyl (Discret. Math., 2018)

Well-covered token graphs. - Fred M. Abdelmalek; Esther Vander Meulen; Kevin N. Vander Meulen; Adam Van Tuyl (Discuss. Math. Graph Theory, 2023)