25,161
edits
Changes
no edit summary
* [[Landon Rabern]] ('''2007'''). ''[https://www.combinatorics.org/ojs/index.php/eljc/article/view/v14i1n22 The Borodin-Kostochka Conjecture for Graphs Containing a Doubly Critical Edge]''. [https://en.wikipedia.org/wiki/Electronic_Journal_of_Combinatorics Electronic Journal of Combinatorics], Vol. 14
* [[Landon Rabern]] ('''2008'''). ''[https://epubs.siam.org/doi/abs/10.1137/060659193 A Note On Reed's Conjecture]''. [https://en.wikipedia.org/wiki/SIAM_Journal_on_Discrete_Mathematics SIAM Journal on Discrete Mathematics], Vol. 22, No. 2 <ref>[https://en.wikipedia.org/wiki/Chv%C3%A1tal_graph Chvátal graph from Wikipedia]</ref>
* [http://brianrabern.net/ Brian Rabern], [[Landon Rabern]] ('''2008'''). ''[https://academic.oup.com/analysis/article-abstract/68/2/105/2740445?redirectedFrom=fulltext A simple solution to the hardest logic puzzle ever]''. [https://en.wikipedia.org/wiki/Analysis_(journal) Analysis], Vol. 68, No. 2 <ref>[https://en.wikipedia.org/wiki/The_Hardest_Logic_Puzzle_Ever The Hardest Logic Puzzle Ever - Wikimedia]</ref>
* [[Landon Rabern]] ('''2009'''). ''On hitting all maximum cliques with an independent set''. [https://arxiv.org/abs/0907.3705 arXiv:0907.3705]
==2010 ...==
* [[Mathematician#DWCranston|Daniel W. Cranston]], [[Landon Rabern]] ('''2015'''). ''Subcubic edge chromatic critical graphs have many edges''. [https://arxiv.org/abs/1506.04225 arXiv:1506.04225]
* [[Mathematician#DWCranston|Daniel W. Cranston]], [[Landon Rabern]] ('''2015'''). ''Edge-coloring via fixable subgraphs''. [https://arxiv.org/abs/1507.05600 arXiv:1507.05600]
* [[Mathematician#DWCranston|Daniel W. Cranston]], [[Landon Rabern]] ('''2015'''). ''Beyond Degree Choosability''. [https://arxiv.org/abs/1511.00350 arXiv:1511.00350]
* [[Mathematician#HAKierstead|Hal Kierstead]], [[Landon Rabern]] ('''2015'''). ''Extracting list colorings from large independent sets''. [https://arxiv.org/abs/1512.08130 arXiv:1512.08130]
* [[Landon Rabern]] ('''2016'''). ''A better lower bound on average degree of 4-list-critical graphs''. [https://arxiv.org/abs/1602.08532 arXiv:1602.08532]
* [[Landon Rabern]] ('''2016'''). ''A better lower bound on average degree of k-list-critical graphs''. [https://arxiv.org/abs/1608.06989 arXiv:1608.06989]
* [[Mathematician#DWCranston|Daniel W. Cranston]], [[Landon Rabern]] ('''20172018'''). ''[https://www.sciencedirect.com/science/article/pii/S009589561830025X Planar graphs are 9/2-colorable]''. [https://en.wikipedia.org/wiki/Journal_of_Combinatorial_Theory Journal of Combinatorial Theory], Series B, Vol. 133, [https://arxiv.org/abs/1410.7233 arXiv:1410.7233]* [[Mathematician#DWCranston|Daniel W. Cranston]], [[Landon Rabern]] ('''2019'''). ''[https://epubs.siam.org/doi/abs/10.1137/18M117056X The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4]''. [https://en.wikipedia.org/wiki/SIAM_Journal_on_Discrete_Mathematics SIAM Journal on Discrete Mathematics], Vol. 33, No. 3, [https://arxiv.org/abs/1703.00959 arXiv:1703.00959]
=Forum Posts=
* [https://www.stmintz.com/ccc/index.php?id=125117 Re: C or C++ for Chess Programming?] by [[Landon Rabern]], [[CCC]], August 18, 2000
* [https://www.stmintz.com/ccc/index.php?id=128512 Betsy 5.0 is now winboard compatable] by [[Landon Rabern]], [[CCC]], September 06, 2000
* [https://www.stmintz.com/ccc/index.php?id=178491 Betsy 5.26] by [[Landon Rabern]], [[CCC]], July 06, 2001
* [https://www.stmintz.com/ccc/index.php?id=302797 Re: FRC_TheBaron_101 Vs Fritz8 (Castling vs Not Castling rules)] by [[Landon Rabern]], [[CCC]], June 24, 2003
=External Links=
* [https://landon.github.io/ landon rabern]
* [https://www.linkedin.com/in/landon-rabern-421a3173 landon rabern | LinkedIn]
* [https://scholar.google.com/citations?user=aZg5kIEAAAAJ&hl=en landon rabern - Google Scholar Citations]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=176173 Landon Rabern - The Mathematics Genealogy Project]
* [https://github.com/landon andon (landon rabern) · GitHub]
* [https://github.com/landon/Chess GitHub - landon/Chess: Beginnings of a port of Betsy to C#]
=References=
