John Engbers

Orcid: 0000-0001-8898-5702

According to our database1, John Engbers authored at least 20 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Reciprocals of thinned exponential series.
Australas. J Comb., June, 2024

2023
Extremal graphs for average sizes of maximal matchings.
Discret. Appl. Math., December, 2023

2021
Tomescu's Graph Coloring Conjecture for ℓ-Connected Graphs.
SIAM J. Discret. Math., 2021

Independent sets in n-vertex k-chromatic ℓ-connected graphs.
Discret. Math., 2021

2020
Colored multipermutations and a combinatorial generalization of Worpitzky's identity.
Australas. J Comb., 2020

2019
Restricted Stirling and Lah number matrices and their inverses.
J. Comb. Theory A, 2019

Maximizing and minimizing the number of generalized colorings of trees.
Discret. Math., 2019

2018
Combinatorial Proofs of Identities of Alzer and Prodinger and Some Generalizations.
Integers, 2018

Extremal Colorings and Independent Sets.
Graphs Comb., 2018

On comparability of bigrassmannian permutations.
Australas. J Comb., 2018

2017
Maximizing <i>H</i>-Colorings of Connected Graphs with Fixed Minimum Degree.
J. Graph Theory, 2017

Extremal H-colorings of trees and 2-connected graphs.
J. Comb. Theory B, 2017

2016
Two Combinatorial Proofs of Identities Involving Sums of Powers of Binomial Coefficients.
Integers, 2016

2015
Extremal <i>H</i>-Colorings of Graphs with Fixed Minimum Degree.
J. Graph Theory, 2015

Combinatorially interpreting generalized Stirling numbers.
Eur. J. Comb., 2015

Reversible peg solitaire on graphs.
Discret. Math., 2015

2014
Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree.
J. Graph Theory, 2014

Trivial Meet and Join within the Lattice of Monotone Triangles.
Electron. J. Comb., 2014

2012
H-coloring tori.
J. Comb. Theory B, 2012

H-colouring bipartite graphs.
J. Comb. Theory B, 2012


  Loading...