Rainbow Matching in Edge-Colored Graphs. - Timothy D. LeSaulnier; Christopher J. Stocker; Paul S. Wenger; Douglas B. West (Electron. J. Comb., 2010)

Graphs with maximum degree 5 are acyclically 7-colorable. - Alexandr V. Kostochka; Christopher J. Stocker (Ars Math. Contemp., 2011)

On-line Ramsey Theory for Bounded Degree Graphs. - Jane Butterfield; Tracy Grauman; William B. Kinnersley; Kevin G. Milans; Christopher J. Stocker; Douglas B. West (Electron. J. Comb., 2011)

Overlap number of graphs. - Daniel W. Cranston; Nitish Korula; Timothy D. LeSaulnier; Kevin G. Milans; Christopher J. Stocker; Jennifer Vandenbussche; Douglas B. West (J. Graph Theory, 2012)

A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge. - Alexandr V. Kostochka; Christopher J. Stocker; Peter Hamburger (J. Graph Theory, 2013)

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

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

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)

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