Articles
 Planar graphs are 9/2colorable. (with Dan Cranston) J. Combin. Theory Ser. B, Accepted. (pdf)
 A simple solution to the hardest logic puzzle ever. (with Brian Rabern), Analysis 68(298), 105112, 2008. (doi)
 The HiltonZhao Conjecture is True for Graphs with Maximum Degree 4 (with Dan Cranston) (pdf)
 A better lower bound on average degree of klistcritical graphs. (pdf)
 Improved lower bounds on the number of edges in list critical and online list critical graphs. (with Hal Kierstead) (pdf)
 Short fans and the 5/6 bound for line graphs. (with Dan Cranston) SIAM J. Discrete Math., Accepted. (pdf)
 Extracting list colorings from large independent sets. (with Hal Kierstead) J. Graph Theory, Accepted. (pdf)
 Subcubic edge chromatic critical graphs have many edges (with Dan Cranston) J. Graph Theory, Accepted. (pdf)
 Listcoloring clawfree graphs with Δ  1 colors. SIAM J. Discrete Math., Accepted. (with Dan Cranston) (pdf)
 Edge Lower Bounds for List Critical Graphs, via Discharging. Combinatorica, Accepted. (with Dan Cranston) (pdf)
 A better lower bound on average degree of 4listcritical graphs. Electron. J. Combin., Accepted. (pdf) (ejc)
 Planar graphs have independence ratio at least 3/13 (with Dan Cranston) Electron. J. Combin., Accepted. (pdf)
 Painting squares in Δ^2  1 shades. (with Dan Cranston) Electron. J. Combin., Volume 23(2), 2016. (pdf)
 The fractional chromatic number of the plane. (with Dan Cranston) Combinatorica, Accepted. (pdf)
 A note on coloring vertextransitive graphs. (with Dan Cranston) Electron. J. Combin., Volume 22(2), 2015. (pdf)
 Conjectures equivalent to the BorodinKostochka conjecture that appear weaker. (with Dan Cranston) European J. Combinatorics., Volume 44, Part A, February 2015, Pages 23–42 (pdf) (doi)
 The listchromatic index of K_8 and K_10. (pdf)
 Yet another proof of Brooks' theorem. (pdf)
 A game generalizing Hall's Theorem. Discrete Math., 320(6):8791, 2014. (pdf) (doi)
 Coloring graphs with dense neighborhoods. J. Graph Theory, 76(4):323340, 2014. (pdf) (doi)
 Coloring graphs from almost maximum degree sized
 palettes.
Dissertation. (pdf)
 Partitioning and coloring graphs with degree constraints. Discrete Math., 313(9):10281034, 2013. (pdf) (doi)
 Coloring clawfree graphs with Δ  1 colors. (with Dan Cranston) SIAM J. Discrete Math., 27(1):534549, 2013. (pdf) (doi)
 A note on vertex partitions. (pdf)
 Destroying noncomplete regular components in graph partitions. J. Graph Theory, 72(2):123127, 2013. (pdf) (doi)
A note on Reed’s conjecture. SIAM J. Discrete Math., 22(2):820827, 2008. (pdf) (doi) On graph associations. SIAM J. Discrete Math., 20(2):529–535, 2006. (pdf) (doi) Dangerous reference graphs and semantic paradoxes. (with Brian Rabern and Matthew Macauley), Journal of Philosophical Logic, 42(5), 727765, 2013. (doi) Applying groebner basis techniques to group theory. Journal of Pure and Applied Algebra, 210(1):137140, 2007. (doi)
Talks  A common generalization of Hall's theorem and Vizing's
 edgecoloring theorem
(Miami University Colloquium) (slides)
 Extending AlonTarsi Orientations (AMS Special Session on Structural and Extremal Problems) (slides)
 List coloring with large maximum degree. (poster)
 An improvement on Brooks' theorem (CUDenver Discrete Math Seminar). (slides)
 Improving Brooks' theorem (The 26th Clemson Conference on Discrete Math and Algorithms, 2011) (slides)
