**Office:** Katharine Reed Cudahy Hall,
Room 326

**Phone:** (414) 288-6809

**E-mail:** christopher.stocker@mu.edu

- Finite Mathematics
- Elements of Calculus
- Calculus I
- Calculus III
- Discrete Mathematics

- Graph theory
- combinatorics
- discrete mathematics

- Peter Hamburger, Alexandr V. Kostochka, and
**Christopher J. Stocker,**

*A hypergraph version of a graph packing theorem by Bollobás and Eldridge*

J. Graph Theory 74 (2013), no. 2, 222-235

- Daniel W. Cranston, Nitish Korula, Tim LeSaulnier, Kevin Milans,
**Christopher J. Stocker**, Jennifer Vandenbussche, and Douglas B. West.*Overlap Number of Graphs.*J. Graph Theory 70 (2012), no. 1, 10-28.

- Alexandr V. Kostochka and
**Christopher J. Stocker**,*Graphs with maximum degree 5 are acyclically 7-colorable.*Ars Math. Contemp. 4 (2011), no. 1, 153-164. - Jane Butterﬁeld, Tracie Grauman, Bill Kinnersley, Kevin G. Milans,
**Christopher J. Stocker,**and Douglas B. West,*On-line Ramsey Theory for bounded degree graphs*. Electronic J. Combinatorics 18 (2011), no. 1, Paper 136, 17 pp. - Timothy D. LeSaulnier,
**Christopher J. Stocker**, Paul S. Wenger, and Douglas B. West,*Rainbow Matching in Edge-Colored Graphs*. Electronic J. Combinatorics 17 (2010), no. 1, Note 26, 5pp. - Alexandr V. Kostochka and
**Christopher J. Stocker**,*A new bound on the domination number of connected cubic graphs.*Siberian Electronic Mathematical Reports. 6 (2009) 465-504.