landon rabern

Search this site

Teaching

Downloads

Graph Coloring

In Preparation
Submitted
  • A different short proof of Brooks' theorem. (pdf)
  • Conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker. (with Dan Cranston) (pdf)
  • A game generalizing Hall's theorem. (pdf)
  • Partitioning and coloring with degree constraints. (pdf)
Published
  • Destroying non-complete regular components in graph partitions. J. Graph Theory, In Press. (pdf) (doi)
  • A strengthening of Brooks' Theorem for line graphs. Electron. J. Combin., N145, Volume 18(1), 2011. (pdf)

  • \Delta-Critical graphs with small high vertex cliques. J. Combin. Theory Ser. B,  102(1):126-130, 2012.  (pdf) (doi)

  • On hitting all maximum cliques with an independent set.   J. Graph Theory, 66(1):32-37, 2011. (pdf) (doi)

  • The Borodin-Kostochka conjecture for graphs containing a doubly critical edge.  Electron. J. Combin., N22, Volume 14(1), 2007. (pdf)

     

  • A note on Reed’s conjecture. SIAM J. Discrete Math., 22(2):820-827, 2008. (pdf) (doi)

  • On graph associations. SIAM J. Discrete Math., 20(2):529–535, 2006. (pdf)  (doi)

Manuscripts
  • Dissertation prospectus. (pdf)
  • An improvement on Brooks' Theorem. (pdf)
  • A note on vertex partitions. (pdf)