On Graph Associations. - Landon Rabern (SIAM J. Discret. Math., 2006)

The Borodin-Kostochka Conjecture for Graphs Containing a Doubly Critical Edge. - Landon Rabern (Electron. J. Comb., 2007)

A Note On Reed's Conjecture. - Landon Rabern (SIAM J. Discret. Math., 2008)

A Strengthening of Brooks' Theorem for Line Graphs. - Landon Rabern (Electron. J. Comb., 2011)

On hitting all maximum cliques with an independent set. - Landon Rabern (J. Graph Theory, 2011)

Graphs with chromatic number close to maximum degree. - Alexandr V. Kostochka; Landon Rabern; Michael Stiebitz (Discret. Math., 2012)

Partitioning and coloring graphs with degree constraints. - Landon Rabern (Discret. Math., 2013)

Destroying Noncomplete Regular Components in Graph Partitions. - Landon Rabern (J. Graph Theory, 2013)

Dangerous Reference Graphs and Semantic Paradoxes. - Landon Rabern; Brian Rabern; Matthew Macauley (J. Philos. Log., 2013)

Coloring Claw-Free Graphs with Delta-1 Colors. - Daniel W. Cranston; Landon Rabern (SIAM J. Discret. Math., 2013)

A game generalizing Hall's Theorem. - Landon Rabern (Discret. Math., 2014)

A different short proof of Brook's theorem. - Landon Rabern (Discuss. Math. Graph Theory, 2014)

Coloring Graphs with Dense Neighborhoods. - Landon Rabern (J. Graph Theory, 2014)

A Note on Coloring Vertex-transitive Graphs. - Daniel W. Cranston; Landon Rabern (Electron. J. Comb., 2015)

Coloring a graph with Δ-1 colors: Conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker. - Daniel W. Cranston; Landon Rabern (Eur. J. Comb., 2015)

Brooks' Theorem and Beyond. - Daniel W. Cranston; Landon Rabern (J. Graph Theory, 2015)

Graphs with χ=Δ Have Big Cliques. - Daniel W. Cranston; Landon Rabern (SIAM J. Discret. Math., 2015)

Painting Squares in $ Delta^2-1$ Shades. - Daniel W. Cranston; Landon Rabern (Electron. J. Comb., 2016)

Planar Graphs have Independence Ratio at least 3/13. - Daniel W. Cranston; Landon Rabern (Electron. J. Comb., 2016)

A Better Lower Bound on Average Degree of 4-List-Critical Graphs. - Landon Rabern (Electron. J. Comb., 2016)

The fractional chromatic number of the plane. - Daniel W. Cranston; Landon Rabern (Comb., 2017)

Beyond Degree Choosability. - Daniel W. Cranston; Landon Rabern (Electron. J. Comb., 2017)

Subcubic Edge-Chromatic Critical Graphs Have Many Edges. - Daniel W. Cranston; Landon Rabern (J. Graph Theory, 2017)

Extracting List Colorings from Large Independent Sets. - Hal A. Kierstead; Landon Rabern (J. Graph Theory, 2017)

List-Coloring Claw-Free Graphs with Δ-1 Colors. - Daniel W. Cranston; Landon Rabern (SIAM J. Discret. Math., 2017)

Short Fans and the 5/6 Bound for Line Graphs. - Daniel W. Cranston; Landon Rabern (SIAM J. Discret. Math., 2017)

Edge Lower Bounds for List Critical Graphs, Via Discharging. - Daniel W. Cranston; Landon Rabern (Comb., 2018)

A Better Lower Bound on Average Degree of Online k-List-Critical Graphs. - Landon Rabern (Electron. J. Comb., 2018)

Planar graphs are 9/2-colorable. - Daniel W. Cranston; Landon Rabern (J. Comb. Theory B, 2018)

The Hilton-Zhao Conjecture is True for Graphs with Maximum Degree 4. - Daniel W. Cranston; Landon Rabern (SIAM J. Discret. Math., 2019)

Improved lower bounds on the number of edges in list critical and online list critical graphs. - Hal A. Kierstead; Landon Rabern (J. Comb. Theory, Ser. B, 2020)

Coloring ( P 5 , gem ) $({P}_{5}, text{gem})$ -free graphs with Δ - 1 ${ rm{ Delta }}-1$ colors. - Daniel W. Cranston; Hudson Lafayette; Landon Rabern (J. Graph Theory, 2022)

MLStar: A System for Synthesis of Machine-Learning Programs. - Gabriel Kopito; Jonathan Schwartz; Julien Amblard; Robert Filman; Landon Rabern (GECCO Companion, 2023)

The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree. - Ilkyoo Choi; Henry A. Kierstead; Landon Rabern (Discret. Math., 2023)

Yet another proof of Brooks' theorem. - Landon Rabern (Discret. Math., 2023)