John Engbers

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 16

Top Topics

Connected Graphs

Independent Set

Top Venues

J. Graph Theory

Australas. J Comb.

Publications

John Engbers, David J. Galvin, Cliff Smyth
Reciprocals of thinned exponential series. Australas. J Comb. 89 (2024)
John Engbers, Aysel Erey
Extremal graphs for average sizes of maximal matchings. Discret. Appl. Math. 341 (2023)
John Engbers, Aysel Erey, Jacob Fox, Xiaoyu He
Tomescu's Graph Coloring Conjecture for ℓ-Connected Graphs. SIAM J. Discret. Math. 35 (2) (2021)
John Engbers, Lauren Keough, Taylor Short
Independent sets in n-vertex k-chromatic ℓ-connected graphs. Discret. Math. 344 (7) (2021)
John Engbers, Jay Pantone, Christopher J. Stocker
Colored multipermutations and a combinatorial generalization of Worpitzky's identity. Australas. J Comb. 78 (2020)
John Engbers, David J. Galvin, Clifford Smyth
Restricted Stirling and Lah number matrices and their inverses. J. Comb. Theory, Ser. A 161 (2019)
John Engbers, Christopher J. Stocker
Maximizing and minimizing the number of generalized colorings of trees. Discret. Math. 342 (4) (2019)
John Engbers, Christopher J. Stocker
Combinatorial Proofs of Identities of Alzer and Prodinger and Some Generalizations. Integers 18 (2018)
John Engbers, Aysel Erey
Extremal Colorings and Independent Sets. Graphs Comb. 34 (6) (2018)
John Engbers, Adam Hammett
On comparability of bigrassmannian permutations. Australas. J Comb. 71 (2018)
John Engbers
-Colorings of Connected Graphs with Fixed Minimum Degree. J. Graph Theory 85 (4) (2017)
John Engbers, David J. Galvin
Extremal H-colorings of trees and 2-connected graphs. J. Comb. Theory, Ser. B 122 (2017)
John Engbers, Christopher J. Stocker
Two Combinatorial Proofs of Identities Involving Sums of Powers of Binomial Coefficients. Integers 16 (2016)
John Engbers, David J. Galvin, Justin Hilyard
Combinatorially interpreting generalized Stirling numbers. Eur. J. Comb. 43 (2015)
John Engbers, Christopher J. Stocker
Reversible peg solitaire on graphs. Discret. Math. 338 (11) (2015)
John Engbers
-Colorings of Graphs with Fixed Minimum Degree. J. Graph Theory 79 (2) (2015)
John Engbers, David J. Galvin
Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree. J. Graph Theory 76 (2) (2014)
John Engbers, Adam Hammett
Trivial Meet and Join within the Lattice of Monotone Triangles. Electron. J. Comb. 21 (3) (2014)
John Engbers, David J. Galvin, Justin Hilyard
Combinatorially interpreting generalized Stirling numbers. CoRR (2013)
John Engbers, David J. Galvin
H-coloring tori. J. Comb. Theory, Ser. B 102 (5) (2012)
John Engbers, David J. Galvin
H-colouring bipartite graphs. J. Comb. Theory, Ser. B 102 (3) (2012)