Landon Rabern

发表

Beyond Degree Choosability

Daniel W. Cranston, Landon Rabern, 2017, Electron. J. Comb..

The fractional chromatic number of the plane

Daniel W. Cranston, Landon Rabern, 2017, Comb..

Coloring Claw-Free Graphs with Delta-1 Colors

Daniel W. Cranston, Landon Rabern, 2013, SIAM J. Discret. Math..

Brooks' Theorem and Beyond

Daniel W. Cranston, Landon Rabern, Landon Rabern, 2014, J. Graph Theory.

Coloring a graph with Δ-1 colors: Conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker

Daniel W. Cranston, Landon Rabern, Landon Rabern, 2012, Eur. J. Comb..

Planar Graphs have Independence Ratio at least 3/13

Daniel W. Cranston, Landon Rabern, 2016, Electron. J. Comb..

A COMPUTERIZED SYSTEM FOR GRAPH THEORY, ILLUSTRATED BY PARTIAL PROOFS FOR GRAPH-COLORING PROBLEMS *

Dieter Gernert, Landon Rabern, D. Gernert, 2008 .

The Borodin-Kostochka Conjecture for Graphs Containing a Doubly Critical Edge

Landon Rabern, 2007, Electron. J. Comb..

Partitioning and coloring graphs with degree constraints

Landon Rabern, 2013, Discret. Math..

A Better Lower Bound on Average Degree of Online k-List-Critical Graphs

Landon Rabern, Landon Rabern, 2018, Electron. J. Comb..

A Better Lower Bound on Average Degree of 4-List-Critical Graphs

Landon Rabern, 2016, Electron. J. Comb..

On hitting all maximum cliques with an independent set

Landon Rabern, Landon Rabern, 2009, J. Graph Theory.

On Graph Associations

Landon Rabern, 2006, SIAM J. Discret. Math..

The Hilton-Zhao Conjecture is True for Graphs with Maximum Degree 4

Daniel W. Cranston, Landon Rabern, 2019, SIAM J. Discret. Math..

Graphs with chromatic number close to maximum degree

Alexandr V. Kostochka, Michael Stiebitz, Landon Rabern, 2012, Discret. Math..

A Strengthening of Brooks' Theorem for Line Graphs

Landon Rabern, 2011, Electron. J. Comb..

Planar graphs are 9/2-colorable

Daniel W. Cranston, Landon Rabern, Landon Rabern, 2014, J. Comb. Theory B.

List-Coloring Claw-Free Graphs with Δ-1 Colors

Daniel W. Cranston, Landon Rabern, 2017, SIAM J. Discret. Math..

Dangerous Reference Graphs and Semantic Paradoxes

Landon Rabern, Brian Rabern, Matthew Macauley, 2013, J. Philos. Log..

Short Fans and the 5/6 Bound for Line Graphs

Daniel W. Cranston, Landon Rabern, 2017, SIAM J. Discret. Math..

Destroying Noncomplete Regular Components in Graph Partitions

Landon Rabern, 2013, J. Graph Theory.

Coloring Graphs with Dense Neighborhoods

Landon Rabern, Landon Rabern, 2012, J. Graph Theory.

Painting Squares in $\Delta^2-1$ Shades

Daniel W. Cranston, Landon Rabern, Landon Rabern, 2013, Electron. J. Comb..

Improved lower bounds on the number of edges in list critical and online list critical graphs

Landon Rabern, Hal Kierstead, H. Kierstead, 2014, J. Comb. Theory, Ser. B.

A Note On Reed's Conjecture

Landon Rabern, 2008, SIAM J. Discret. Math..

A Note on Coloring Vertex-transitive Graphs

Daniel W. Cranston, Landon Rabern, Landon Rabern, 2014, Electron. J. Comb..

Extracting List Colorings from Large Independent Sets

Hal A. Kierstead, Landon Rabern, 2017, J. Graph Theory.

Edge Lower Bounds for List Critical Graphs, Via Discharging

Daniel W. Cranston, Landon Rabern, 2018, Comb..

A game generalizing Hall's Theorem

Landon Rabern, Landon Rabern, 2012, Discret. Math..

A Different Short Proof of Brooks’ Theorem

Landon Rabern, 2014, Discuss. Math. Graph Theory.

Subcubic Edge‐Chromatic Critical Graphs Have Many Edges

Daniel W. Cranston, Landon Rabern, Landon Rabern, 2015, J. Graph Theory.

Graphs with χ=Δ Have Big Cliques

Daniel W. Cranston, Landon Rabern, Landon Rabern, 2015, SIAM J. Discret. Math..

Structural fixed-point theorems

Landon Rabern, Brian Rabern, 2021 .

Coloring claw-free graphs with − 1 colors

Daniel W. Cranston, Landon Rabern, Landon Rabern, 2012 .

An Improvement On Brooks' Theorem

Landon Rabern, 2011 .

A simple solution to the hardest logic puzzle ever

Landon Rabern, Brian Rabern, 2008 .

Coloring and The Lonely Graph

Landon Rabern, 2007 .

Painting Squares in 2 1 Shades

Daniel W. Cranston, Landon Rabern, Landon Rabern, 2014 .

Coloring $\Delta$-Critical Graphs With Small High Vertex Cliques

Landon Rabern, 2011 .

Δ-Critical graphs with small high vertex cliques

Landon Rabern, Landon Rabern, 2012 .

C O ] 1 6 M ay 2 01 3 Graphs with χ = ∆ have big cliques

Daniel W. Cranston, Landon Rabern, Landon Rabern, 2013 .