H-colouring bipartite graphs. - John Engbers; David J. Galvin (J. Comb. Theory B, 2012)

H-coloring tori. - John Engbers; David J. Galvin (J. Comb. Theory B, 2012)

Trivial Meet and Join within the Lattice of Monotone Triangles. - John Engbers; Adam Hammett (Electron. J. Comb., 2014)

Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree. - John Engbers; David J. Galvin (J. Graph Theory, 2014)

Reversible peg solitaire on graphs. - John Engbers; Christopher J. Stocker (Discret. Math., 2015)

Combinatorially interpreting generalized Stirling numbers. - John Engbers; David J. Galvin; Justin Hilyard (Eur. J. Comb., 2015)

Extremal H-Colorings of Graphs with Fixed Minimum Degree. - John Engbers (J. Graph Theory, 2015)

Two Combinatorial Proofs of Identities Involving Sums of Powers of Binomial Coefficients. - John Engbers; Christopher J. Stocker (Integers, 2016)

Extremal H-colorings of trees and 2-connected graphs. - John Engbers; David J. Galvin (J. Comb. Theory B, 2017)

Maximizing H-Colorings of Connected Graphs with Fixed Minimum Degree. - John Engbers (J. Graph Theory, 2017)

On comparability of bigrassmannian permutations. - John Engbers; Adam Hammett (Australas. J Comb., 2018)

Extremal Colorings and Independent Sets. - John Engbers; Aysel Erey (Graphs Comb., 2018)

Combinatorial Proofs of Identities of Alzer and Prodinger and Some Generalizations. - John Engbers; Christopher J. Stocker (Integers, 2018)

Maximizing and minimizing the number of generalized colorings of trees. - John Engbers; Christopher J. Stocker (Discret. Math., 2019)

Restricted Stirling and Lah number matrices and their inverses. - John Engbers; David J. Galvin; Cliff Smyth 001 (J. Comb. Theory A, 2019)

Colored multipermutations and a combinatorial generalization of Worpitzky's identity. - John Engbers; Jay Pantone; Christopher J. Stocker (Australas. J Comb., 2020)

Independent sets in n-vertex k-chromatic ℓ-connected graphs. - John Engbers; Lauren Keough; Taylor Short (Discret. Math., 2021)

Tomescu's Graph Coloring Conjecture for ℓ-Connected Graphs. - John Engbers; Aysel Erey; Jacob Fox; Xiaoyu He (SIAM J. Discret. Math., 2021)

Extremal graphs for average sizes of maximal matchings. - John Engbers; Aysel Erey (Discret. Appl. Math., 2023)

Reciprocals of thinned exponential series. - John Engbers; David J. Galvin; Cliff Smyth 001 (Australas. J Comb., 2024)

Maximizing the Number of H-Colorings of Graphs with a Fixed Minimum Degree. - John Engbers (Graphs Comb., 2024)

Extremal Graphs for Widom-Rowlinson Colorings in k-Chromatic Graphs. - John Engbers; Aysel Erey (Graphs Comb., 2024)