The Borodin-Kostochka conjecture for graphs containing a doubly critical edge. Rabern, Landon — 2007 The Electronic Journal of Combinatorics [electronic only]
A strengthening of Brooks' Theorem for line graphs. Rabern, Landon — 2011 The Electronic Journal of Combinatorics [electronic only]
A Different Short Proof of Brooks’ Theorem Landon Rabern — 2014 Discussiones Mathematicae Graph Theory Lovász gave a short proof of Brooks’ theorem by coloring greedily in a good order. We give a different short proof by reducing to the cubic case.