Landon Rabern

Orcid: 0000-0002-8075-6806

According to our database1, Landon Rabern authored at least 35 papers between 2006 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Yet another proof of Brooks' theorem.
Discret. Math., November, 2023

The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree.
Discret. Math., November, 2023

MLStar: A System for Synthesis of Machine-Learning Programs.
Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023

2022
Coloring ( P 5 , gem ) $({P}_{5}, \text{gem})$ -free graphs with Δ - 1 ${\rm{\Delta }}-1$ colors.
J. Graph Theory, 2022

2020
Improved lower bounds on the number of edges in list critical and online list critical graphs.
J. Comb. Theory, Ser. B, 2020

2019
The Hilton-Zhao Conjecture is True for Graphs with Maximum Degree 4.
SIAM J. Discret. Math., 2019

2018
Planar graphs are 9/2-colorable.
J. Comb. Theory B, 2018

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

Edge Lower Bounds for List Critical Graphs, Via Discharging.
Comb., 2018

2017
Short Fans and the 5/6 Bound for Line Graphs.
SIAM J. Discret. Math., 2017

List-Coloring Claw-Free Graphs with Δ-1 Colors.
SIAM J. Discret. Math., 2017

Extracting List Colorings from Large Independent Sets.
J. Graph Theory, 2017

Subcubic Edge-Chromatic Critical Graphs Have Many Edges.
J. Graph Theory, 2017

Beyond Degree Choosability.
Electron. J. Comb., 2017

The fractional chromatic number of the plane.
Comb., 2017

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

Planar Graphs have Independence Ratio at least 3/13.
Electron. J. Comb., 2016

Painting Squares in $\Delta^2-1$ Shades.
Electron. J. Comb., 2016

2015
Graphs with χ=Δ Have Big Cliques.
SIAM J. Discret. Math., 2015

Brooks' Theorem and Beyond.
J. Graph Theory, 2015

Coloring a graph with Δ-1 colors: Conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker.
Eur. J. Comb., 2015

A Note on Coloring Vertex-transitive Graphs.
Electron. J. Comb., 2015

2014
Coloring Graphs with Dense Neighborhoods.
J. Graph Theory, 2014

A different short proof of Brook's theorem.
Discuss. Math. Graph Theory, 2014

A game generalizing Hall's Theorem.
Discret. Math., 2014

2013
Coloring Claw-Free Graphs with Delta-1 Colors.
SIAM J. Discret. Math., 2013

Dangerous Reference Graphs and Semantic Paradoxes.
J. Philos. Log., 2013

Destroying Noncomplete Regular Components in Graph Partitions.
J. Graph Theory, 2013

Partitioning and coloring graphs with degree constraints.
Discret. Math., 2013

2012
Graphs with chromatic number close to maximum degree.
Discret. Math., 2012

2011
On hitting all maximum cliques with an independent set.
J. Graph Theory, 2011

A Strengthening of Brooks' Theorem for Line Graphs.
Electron. J. Comb., 2011

2008
A Note On Reed's Conjecture.
SIAM J. Discret. Math., 2008

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

2006
On Graph Associations.
SIAM J. Discret. Math., 2006


  Loading...