Landon Rabern, Ph.D.
Affiliations: | 2013 | Mathematics | Arizona State University, Tempe, AZ, United States |
Area:
MathematicsGoogle:
"Landon Rabern"Parents
Sign in to add mentor| Henry A. Kierstead | grad student | 2013 | Arizona State | |
| (Coloring Graphs from Almost Maximum Degree Sized Palettes.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Kierstead HA, Rabern L. (2020) Improved lower bounds on the number of edges in list critical and online list critical graphs Journal of Combinatorial Theory, Series B. 140: 147-170 |
| Cranston DW, Rabern L. (2019) The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4 Siam Journal On Discrete Mathematics. 33: 1228-1241 |
| Cranston DW, Rabern L. (2018) Planar graphs are 9/2-colorable Journal of Combinatorial Theory, Series B. 133: 32-45 |
| Cranston DW, Rabern L. (2018) Edge Lower Bounds for List Critical Graphs, via Discharging Combinatorica. 38: 1045-1065 |
| Cranston DW, Rabern L. (2017) Beyond Degree Choosability Electronic Journal of Combinatorics. 24: 3-29 |
| Cranston DW, Rabern L. (2017) Short Fans and the 5/6 Bound for Line Graphs Siam Journal On Discrete Mathematics. 31: 2039-2063 |
| Cranston DW, Rabern L. (2017) The fractional chromatic number of the plane Combinatorica. 37: 837-861 |
| Kierstead HA, Rabern L. (2017) Extracting list colorings from large independent sets Journal of Graph Theory. 86: 315-328 |
| Cranston DW, Rabern L. (2017) Subcubic Edge-Chromatic Critical Graphs Have Many Edges Journal of Graph Theory. 86: 122-136 |
| Rabern L. (2016) A Better Lower Bound on Average Degree of 4-List-Critical Graphs Electronic Journal of Combinatorics. 23: 1-51 |