Landon Rabern

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