We stand with Ukraine  

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.
[BibTeX]
[DOI]
Landon Rabern
Discret. Math., November, 2023

The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree.
[BibTeX]
[DOI]
Ilkyoo Choi
,
Henry A. Kierstead
,
Landon Rabern
Discret. Math., November, 2023

MLStar: A System for Synthesis of Machine-Learning Programs.
[BibTeX]
[DOI]
Gabriel Kopito
,
Jonathan Schwartz
,
Julien Amblard
,
Robert Filman
,
Landon Rabern
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.
[BibTeX]
[DOI]
Daniel W. Cranston
,
Hudson Lafayette
,
Landon Rabern
J. Graph Theory, 2022

2020
Improved lower bounds on the number of edges in list critical and online list critical graphs.
[BibTeX]
[DOI]
Hal A. Kierstead
,
Landon Rabern
J. Comb. Theory, Ser. B, 2020

2019
The Hilton-Zhao Conjecture is True for Graphs with Maximum Degree 4.
[BibTeX]
[DOI]
Daniel W. Cranston
,
Landon Rabern
SIAM J. Discret. Math., 2019

2018
Planar graphs are 9/2-colorable.
[BibTeX]
[DOI]
Daniel W. Cranston
,
Landon Rabern
J. Comb. Theory, Ser. B, 2018

A Better Lower Bound on Average Degree of Online k-List-Critical Graphs.
[BibTeX]
[DOI]
Landon Rabern
Electron. J. Comb., 2018

Edge Lower Bounds for List Critical Graphs, Via Discharging.
[BibTeX]
[DOI]
Daniel W. Cranston
,
Landon Rabern
Comb., 2018

2017
Short Fans and the 5/6 Bound for Line Graphs.
[BibTeX]
[DOI]
Daniel W. Cranston
,
Landon Rabern
SIAM J. Discret. Math., 2017

List-Coloring Claw-Free Graphs with Δ-1 Colors.
[BibTeX]
[DOI]
Daniel W. Cranston
,
Landon Rabern
SIAM J. Discret. Math., 2017

Extracting List Colorings from Large Independent Sets.
[BibTeX]
[DOI]
Hal A. Kierstead
,
Landon Rabern
J. Graph Theory, 2017

Subcubic Edge-Chromatic Critical Graphs Have Many Edges.
[BibTeX]
[DOI]
Daniel W. Cranston
,
Landon Rabern
J. Graph Theory, 2017

Beyond Degree Choosability.
[BibTeX]
[DOI]
Daniel W. Cranston
,
Landon Rabern
Electron. J. Comb., 2017

The fractional chromatic number of the plane.
[BibTeX]
[DOI]
Daniel W. Cranston
,
Landon Rabern
Comb., 2017

2016
A Better Lower Bound on Average Degree of 4-List-Critical Graphs.
[BibTeX]
[DOI]
Landon Rabern
Electron. J. Comb., 2016

Planar Graphs have Independence Ratio at least 3/13.
[BibTeX]
[DOI]
Daniel W. Cranston
,
Landon Rabern
Electron. J. Comb., 2016

Painting Squares in $\Delta^2-1$ Shades.
[BibTeX]
[DOI]
Daniel W. Cranston
,
Landon Rabern
Electron. J. Comb., 2016

2015
Graphs with χ=Δ Have Big Cliques.
[BibTeX]
[DOI]
Daniel W. Cranston
,
Landon Rabern
SIAM J. Discret. Math., 2015

Brooks' Theorem and Beyond.
[BibTeX]
[DOI]
Daniel W. Cranston
,
Landon Rabern
J. Graph Theory, 2015

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

A Note on Coloring Vertex-transitive Graphs.
[BibTeX]
[DOI]
Daniel W. Cranston
,
Landon Rabern
Electron. J. Comb., 2015

2014
Coloring Graphs with Dense Neighborhoods.
[BibTeX]
[DOI]
Landon Rabern
J. Graph Theory, 2014

A different short proof of Brook's theorem.
[BibTeX]
[DOI]
Landon Rabern
Discuss. Math. Graph Theory, 2014

A game generalizing Hall's Theorem.
[BibTeX]
[DOI]
Landon Rabern
Discret. Math., 2014

2013
Coloring Claw-Free Graphs with Delta-1 Colors.
[BibTeX]
[DOI]
Daniel W. Cranston
,
Landon Rabern
SIAM J. Discret. Math., 2013

Dangerous Reference Graphs and Semantic Paradoxes.
[BibTeX]
[DOI]
Landon Rabern
,
Brian Rabern
,
Matthew Macauley
J. Philos. Log., 2013

Destroying Noncomplete Regular Components in Graph Partitions.
[BibTeX]
[DOI]
Landon Rabern
J. Graph Theory, 2013

Partitioning and coloring graphs with degree constraints.
[BibTeX]
[DOI]
Landon Rabern
Discret. Math., 2013

2012
Graphs with chromatic number close to maximum degree.
[BibTeX]
[DOI]
Alexandr V. Kostochka
,
Landon Rabern
,
Michael Stiebitz
Discret. Math., 2012

2011
On hitting all maximum cliques with an independent set.
[BibTeX]
[DOI]
Landon Rabern
J. Graph Theory, 2011

A Strengthening of Brooks' Theorem for Line Graphs.
[BibTeX]
[DOI]
Landon Rabern
Electron. J. Comb., 2011

2008
A Note On Reed's Conjecture.
[BibTeX]
[DOI]
Landon Rabern
SIAM J. Discret. Math., 2008

2007
The Borodin-Kostochka Conjecture for Graphs Containing a Doubly Critical Edge.
[BibTeX]
[DOI]
Landon Rabern
Electron. J. Comb., 2007

2006
On Graph Associations.
[BibTeX]
[DOI]
Landon Rabern
SIAM J. Discret. Math., 2006


  Loading...