Christopher J. Stocker

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Colored Multipermutations and a Combinatorial Generalization of Worpitzky's Identity	2020-12-10	Paper
Colored Multipermutations and a Combinatorial Generalization of Worpitzky's Identity (available as arXiv preprint)	2020-12-10	Paper
Combinatorial proofs of identities of Alzer and prodinger and some generalizations	2019-06-21	Paper
Maximizing and minimizing the number of generalized colorings of trees Discrete Mathematics	2019-02-20	Paper
Maximizing and minimizing the number of generalized colorings of trees Discrete Mathematics	2019-02-20	Paper
Two combinatorial proofs of identities involving sums of powers of binomial coefficients Integers	2016-10-28	Paper
Reversible peg solitaire on graphs Discrete Mathematics	2015-06-29	Paper
A new bound on the domination number of connected cubic graphs Sibirskie Elektronnye Matematicheskie Izvestiya	2014-06-13	Paper
A hypergraph version of a graph packing theorem by Bollobás and Eldridge Journal of Graph Theory	2013-10-21	Paper
Overlap number of graphs Journal of Graph Theory	2012-06-04	Paper
Graphs with maximum degreee 5 are acyclically 7-colorable Ars Mathematica Contemporanea	2012-03-07	Paper
On-line Ramsey theory for bounded degree graphs The Electronic Journal of Combinatorics	2011-07-15	Paper
On-line Ramsey theory for bounded degree graphs The Electronic Journal of Combinatorics	2011-07-15	Paper
Rainbow matching in edge-colored graphs The Electronic Journal of Combinatorics	2010-06-16	Paper
Rainbow matching in edge-colored graphs The Electronic Journal of Combinatorics	2010-06-16	Paper

Research outcomes over time

This page was built for person: Christopher J. Stocker