Landon Rabern

Publication Activity (10 Years)

Years Active: 2006-2023
Publications (10 Years): 18

Top Topics

Graph Theoretic

Top Venues

Electron. J. Comb.

J. Graph Theory

SIAM J. Discret. Math.

Publications

Landon Rabern
Yet another proof of Brooks' theorem. Discret. Math. 346 (11) (2023)
Ilkyoo Choi, Henry A. Kierstead, Landon Rabern
The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree. Discret. Math. 346 (11) (2023)
Gabriel Kopito, Jonathan Schwartz, Julien Amblard, Robert Filman, Landon Rabern
MLStar: A System for Synthesis of Machine-Learning Programs. GECCO Companion (2023)
Daniel W. Cranston, Hudson Lafayette, Landon Rabern
Coloring ( P 5 , gem ) $({P}_{5}, \text{gem})$ -free graphs with Δ - 1 ${\rm{\Delta }}-1$ colors. J. Graph Theory 101 (4) (2022)
Hal A. Kierstead, Landon Rabern
Improved lower bounds on the number of edges in list critical and online list critical graphs. J. Comb. Theory, Ser. B 140 (2020)
Daniel W. Cranston, Landon Rabern
The Hilton-Zhao Conjecture is True for Graphs with Maximum Degree 4. SIAM J. Discret. Math. 33 (3) (2019)
Daniel W. Cranston, Landon Rabern
Edge Lower Bounds for List Critical Graphs, Via Discharging. Comb. 38 (5) (2018)
Landon Rabern
A Better Lower Bound on Average Degree of Online k-List-Critical Graphs. Electron. J. Comb. 25 (1) (2018)
Daniel W. Cranston, Landon Rabern
Planar graphs are 9/2-colorable. J. Comb. Theory, Ser. B 133 (2018)
Daniel W. Cranston, Landon Rabern
Subcubic Edge-Chromatic Critical Graphs Have Many Edges. J. Graph Theory 86 (1) (2017)
Daniel W. Cranston, Landon Rabern
Beyond Degree Choosability. Electron. J. Comb. 24 (3) (2017)
Hal A. Kierstead, Landon Rabern
Extracting List Colorings from Large Independent Sets. J. Graph Theory 86 (3) (2017)
Daniel W. Cranston, Landon Rabern
Short Fans and the 5/6 Bound for Line Graphs. SIAM J. Discret. Math. 31 (3) (2017)
Daniel W. Cranston, Landon Rabern
List-Coloring Claw-Free Graphs with Δ-1 Colors. SIAM J. Discret. Math. 31 (2) (2017)
Daniel W. Cranston, Landon Rabern
The fractional chromatic number of the plane. Comb. 37 (5) (2017)
Daniel W. Cranston, Landon Rabern
Planar Graphs have Independence Ratio at least 3/13. Electron. J. Comb. 23 (3) (2016)
Daniel W. Cranston, Landon Rabern
Painting Squares in $\Delta^2-1$ Shades. Electron. J. Comb. 23 (2) (2016)
Landon Rabern
A Better Lower Bound on Average Degree of 4-List-Critical Graphs. Electron. J. Comb. 23 (3) (2016)
Daniel W. Cranston, Landon Rabern
Coloring a graph with Δ-1 colors: Conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker. Eur. J. Comb. 44 (2015)
Daniel W. Cranston, Landon Rabern
Brooks' Theorem and Beyond. J. Graph Theory 80 (3) (2015)
Daniel W. Cranston, Landon Rabern
A Note on Coloring Vertex-transitive Graphs. Electron. J. Comb. 22 (2) (2015)
Daniel W. Cranston, Landon Rabern
Graphs with χ=Δ Have Big Cliques. SIAM J. Discret. Math. 29 (4) (2015)
Landon Rabern
A game generalizing Hall's Theorem. Discret. Math. 320 (2014)
Landon Rabern
Coloring Graphs with Dense Neighborhoods. J. Graph Theory 76 (4) (2014)
Landon Rabern
A different short proof of Brook's theorem. Discuss. Math. Graph Theory 34 (3) (2014)
Landon Rabern
Partitioning and coloring graphs with degree constraints. Discret. Math. 313 (9) (2013)
Landon Rabern, Brian Rabern, Matthew Macauley
Dangerous Reference Graphs and Semantic Paradoxes. J. Philos. Log. 42 (5) (2013)
Landon Rabern
Destroying Noncomplete Regular Components in Graph Partitions. J. Graph Theory 72 (2) (2013)
Daniel W. Cranston, Landon Rabern
Coloring Claw-Free Graphs with Delta-1 Colors. SIAM J. Discret. Math. 27 (1) (2013)
Alexandr V. Kostochka, Landon Rabern, Michael Stiebitz
Graphs with chromatic number close to maximum degree. Discret. Math. 312 (6) (2012)
Landon Rabern
On hitting all maximum cliques with an independent set. J. Graph Theory 66 (1) (2011)
Landon Rabern
A Strengthening of Brooks' Theorem for Line Graphs. Electron. J. Comb. 18 (1) (2011)
Landon Rabern
A Note On Reed's Conjecture. SIAM J. Discret. Math. 22 (2) (2008)
Landon Rabern
The Borodin-Kostochka Conjecture for Graphs Containing a Doubly Critical Edge. Electron. J. Comb. 14 (1) (2007)
Landon Rabern
On Graph Associations. SIAM J. Discret. Math. 20 (2) (2006)