Daniel W. Cranston, Nitish Korula, Timothy D. LeSaulnier, Kevin G, Milans, C. J. Stocker, and Jennifer Vandenbussche, Overlap Number of graphs. J. Graph Theory (in press, published online 18 February 2011), DOI: 10.1002/jgt.20598
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.
The Department of Mathematics, Statistics and Computer Science is hosting the NSF-funded Summer 2013 Research Experience (REU) for Undergraduates. This program provides U.S. undergraduates with an intensive, faculty-mentored, summer research experience in the areas of applied mathematics, high-performance computing, statistics, ubiquitous systems and mathematics education. Learn more