John Engbers

Aysel Erey

Graphs Comb., December, 2024

Maximizing the Number of H-Colorings of Graphs with a Fixed Minimum Degree.

[BibT_eX]

[DOI]

Graphs Comb., December, 2024

Reciprocals of thinned exponential series.

[BibT_eX]

[DOI]

Cliff Smyth

Australas. J Comb., June, 2024

2023

Extremal graphs for average sizes of maximal matchings.

[BibT_eX]

[DOI]

Aysel Erey

Discret. Appl. Math., December, 2023

2021

Tomescu's Graph Coloring Conjecture for ℓ-Connected Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Independent sets in n-vertex k-chromatic ℓ-connected graphs.

[BibT_eX]

[DOI]

Lauren Keough

Taylor Short

Discret. Math., 2021

2020

Colored multipermutations and a combinatorial generalization of Worpitzky's identity.

[BibT_eX]

[DOI]

Jay Pantone

Australas. J Comb., 2020

2019

Restricted Stirling and Lah number matrices and their inverses.

[BibT_eX]

[DOI]

Cliff Smyth

J. Comb. Theory A, 2019

Maximizing and minimizing the number of generalized colorings of trees.

[BibT_eX]

[DOI]

Discret. Math., 2019

2018

Combinatorial Proofs of Identities of Alzer and Prodinger and Some Generalizations.

[BibT_eX]

[DOI]

Integers, 2018

Extremal Colorings and Independent Sets.

[BibT_eX]

[DOI]

Aysel Erey

Graphs Comb., 2018

On comparability of bigrassmannian permutations.

[BibT_eX]

[DOI]

Adam Hammett

Australas. J Comb., 2018

2017

Maximizing <i>H</i>-Colorings of Connected Graphs with Fixed Minimum Degree.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Extremal H-colorings of trees and 2-connected graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

2016

Two Combinatorial Proofs of Identities Involving Sums of Powers of Binomial Coefficients.

[BibT_eX]

[DOI]

Integers, 2016

2015

Extremal <i>H</i>-Colorings of Graphs with Fixed Minimum Degree.

[BibT_eX]

[DOI]

J. Graph Theory, 2015

Combinatorially interpreting generalized Stirling numbers.

[BibT_eX]

[DOI]

Justin Hilyard

Eur. J. Comb., 2015

Reversible peg solitaire on graphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

2014

Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree.

[BibT_eX]

[DOI]

J. Graph Theory, 2014

Trivial Meet and Join within the Lattice of Monotone Triangles.

[BibT_eX]

[DOI]

Adam Hammett

Electron. J. Comb., 2014

2012

H-coloring tori.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

H-colouring bipartite graphs.

[BibT_eX]

[DOI]