default search action
Landon Rabern
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j34]Landon Rabern:
Yet another proof of Brooks' theorem. Discret. Math. 346(11): 113261 (2023) - [j33]Ilkyoo Choi, Henry A. Kierstead, Landon Rabern:
The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree. Discret. Math. 346(11): 113300 (2023) - [c1]Gabriel Kopito, Jonathan Schwartz, Julien Amblard, Robert Filman, Landon Rabern:
MLStar: A System for Synthesis of Machine-Learning Programs. GECCO Companion 2023: 1721-1726 - 2022
- [j32]Daniel W. Cranston, Hudson Lafayette, Landon Rabern:
Coloring ( P 5 , gem ) $({P}_{5}, \text{gem})$ -free graphs with Δ - 1 ${\rm{\Delta }}-1$ colors. J. Graph Theory 101(4): 633-642 (2022) - 2020
- [j31]Hal A. Kierstead, Landon Rabern:
Improved lower bounds on the number of edges in list critical and online list critical graphs. J. Comb. Theory, Ser. B 140: 147-170 (2020)
2010 – 2019
- 2019
- [j30]Daniel W. Cranston, Landon Rabern:
The Hilton-Zhao Conjecture is True for Graphs with Maximum Degree 4. SIAM J. Discret. Math. 33(3): 1228-1241 (2019) - 2018
- [j29]Daniel W. Cranston, Landon Rabern:
Edge Lower Bounds for List Critical Graphs, Via Discharging. Comb. 38(5): 1045-1065 (2018) - [j28]Landon Rabern:
A Better Lower Bound on Average Degree of Online k-List-Critical Graphs. Electron. J. Comb. 25(1): 1 (2018) - [j27]Daniel W. Cranston, Landon Rabern:
Planar graphs are 9/2-colorable. J. Comb. Theory B 133: 32-45 (2018) - 2017
- [j26]Daniel W. Cranston, Landon Rabern:
The fractional chromatic number of the plane. Comb. 37(5): 837-861 (2017) - [j25]Daniel W. Cranston, Landon Rabern:
Beyond Degree Choosability. Electron. J. Comb. 24(3): 3 (2017) - [j24]Daniel W. Cranston, Landon Rabern:
Subcubic Edge-Chromatic Critical Graphs Have Many Edges. J. Graph Theory 86(1): 122-136 (2017) - [j23]Hal A. Kierstead, Landon Rabern:
Extracting List Colorings from Large Independent Sets. J. Graph Theory 86(3): 315-328 (2017) - [j22]Daniel W. Cranston, Landon Rabern:
List-Coloring Claw-Free Graphs with Δ-1 Colors. SIAM J. Discret. Math. 31(2): 726-748 (2017) - [j21]Daniel W. Cranston, Landon Rabern:
Short Fans and the 5/6 Bound for Line Graphs. SIAM J. Discret. Math. 31(3): 2039-2063 (2017) - 2016
- [j20]Daniel W. Cranston, Landon Rabern:
Painting Squares in $\Delta^2-1$ Shades. Electron. J. Comb. 23(2): 2 (2016) - [j19]Daniel W. Cranston, Landon Rabern:
Planar Graphs have Independence Ratio at least 3/13. Electron. J. Comb. 23(3): 3 (2016) - [j18]Landon Rabern:
A Better Lower Bound on Average Degree of 4-List-Critical Graphs. Electron. J. Comb. 23(3): 3 (2016) - 2015
- [j17]Daniel W. Cranston, Landon Rabern:
A Note on Coloring Vertex-transitive Graphs. Electron. J. Comb. 22(2): 2 (2015) - [j16]Daniel W. Cranston, Landon Rabern:
Coloring a graph with Δ-1 colors: Conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker. Eur. J. Comb. 44: 23-42 (2015) - [j15]Daniel W. Cranston, Landon Rabern:
Brooks' Theorem and Beyond. J. Graph Theory 80(3): 199-225 (2015) - [j14]Daniel W. Cranston, Landon Rabern:
Graphs with χ=Δ Have Big Cliques. SIAM J. Discret. Math. 29(4): 1792-1814 (2015) - 2014
- [j13]Landon Rabern:
A game generalizing Hall's Theorem. Discret. Math. 320: 87-91 (2014) - [j12]Landon Rabern:
A different short proof of Brook's theorem. Discuss. Math. Graph Theory 34(3): 633-634 (2014) - [j11]Landon Rabern:
Coloring Graphs with Dense Neighborhoods. J. Graph Theory 76(4): 323-340 (2014) - 2013
- [j10]Landon Rabern:
Partitioning and coloring graphs with degree constraints. Discret. Math. 313(9): 1028-1034 (2013) - [j9]Landon Rabern:
Destroying Noncomplete Regular Components in Graph Partitions. J. Graph Theory 72(2): 123-127 (2013) - [j8]Landon Rabern, Brian Rabern, Matthew Macauley:
Dangerous Reference Graphs and Semantic Paradoxes. J. Philos. Log. 42(5): 727-765 (2013) - [j7]Daniel W. Cranston, Landon Rabern:
Coloring Claw-Free Graphs with Delta-1 Colors. SIAM J. Discret. Math. 27(1): 534-549 (2013) - 2012
- [j6]Alexandr V. Kostochka, Landon Rabern, Michael Stiebitz:
Graphs with chromatic number close to maximum degree. Discret. Math. 312(6): 1273-1281 (2012) - 2011
- [j5]Landon Rabern:
A Strengthening of Brooks' Theorem for Line Graphs. Electron. J. Comb. 18(1) (2011) - [j4]Landon Rabern:
On hitting all maximum cliques with an independent set. J. Graph Theory 66(1): 32-37 (2011)
2000 – 2009
- 2008
- [j3]Landon Rabern:
A Note On Reed's Conjecture. SIAM J. Discret. Math. 22(2): 820-827 (2008) - 2007
- [j2]Landon Rabern:
The Borodin-Kostochka Conjecture for Graphs Containing a Doubly Critical Edge. Electron. J. Comb. 14(1) (2007) - 2006
- [j1]Landon Rabern:
On Graph Associations. SIAM J. Discret. Math. 20(2): 529-535 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint