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 - WikimediaWikipedia]</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]] ('''2014'''). ''Brooks' Theorem and Beyond''. [https://arxiv.org/abs/1403.0479 arXiv:1403.0479]
* [[Mathematician#HAKierstead|Hal Kierstead]], [[Landon Rabern]] ('''2014'''). ''Improved lower bounds on the number of edges in list critical and online list critical graphs''. [https://arxiv.org/abs/1406.7355 arXiv:1406.7355]
* [[Landon Rabern]] ('''2014'''). ''[https://www.sciencedirect.com/science/article/pii/S0012365X13005116 A game generalizing Hall’s Theorem]''. [https://en.wikipedia.org/wiki/Discrete_Mathematics_(journal) Discrete Mathematics], Vol. 320 <ref>[https://en.wikipedia.org/wiki/Hall%27s_marriage_theorem Hall's marriage theorem- Wikipedia]</ref>
==2015 ...==
* [[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]
