Christopher J. Stocker

According to our database, Christopher J. Stocker authored at least 10 papers between 2010 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2020

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

John Engbers, Jay Pantone, Christopher J. Stocker

Australas. J Comb., 2020

2019

Maximizing and minimizing the number of generalized colorings of trees.

John Engbers, Christopher J. Stocker

Discret. Math., 2019

2018

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

John Engbers, Christopher J. Stocker

Integers, 2018

2016

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

John Engbers, Christopher J. Stocker

Integers, 2016

2015

Reversible peg solitaire on graphs.

John Engbers, Christopher J. Stocker

Discret. Math., 2015

2013

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

2012

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

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

Graphs with maximum degree 5 are acyclically 7-colorable.

Alexandr V. Kostochka, Christopher J. Stocker

Ars Math. Contemp., 2011

2010

Rainbow Matching in Edge-Colored Graphs.

Timothy D. LeSaulnier, Christopher J. Stocker, Paul S. Wenger, Douglas B. West

Electron. J. Comb., 2010