The following pages link to Landon Rabern (Q311558):
Displaying 38 items.
- A better lower bound on average degree of 4-list-critical graphs (Q311559) (← links)
- Planar graphs have independence ratio at least 3/13 (Q311579) (← links)
- Dangerous reference graphs and semantic paradoxes (Q380999) (← links)
- A game generalizing Hall's theorem (Q394371) (← links)
- Graphs with chromatic number close to maximum degree (Q409481) (← links)
- Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker (Q472396) (← links)
- A strengthening of Brooks' Theorem for line graphs (Q553999) (← links)
- The fractional chromatic number of the plane (Q722307) (← links)
- \(\Delta \)-critical graphs with small high vertex cliques (Q765195) (← links)
- Applying Gröbner basis techniques to group theory. (Q878666) (← links)
- The Borodin-Kostochka conjecture for graphs containing a doubly critical edge (Q1010594) (← links)
- Edge lower bounds for list critical graphs, via discharging (Q1715067) (← links)
- A better lower bound on average degree of online \(k\)-list-critical graphs (Q1753017) (← links)
- Planar graphs are \(9/2\)-colorable (Q1791701) (← links)
- Partitioning and coloring graphs with degree constraints (Q1947012) (← links)
- Improved lower bounds on the number of edges in list critical and online list critical graphs (Q2284728) (← links)
- A note on coloring vertex-transitive graphs (Q2341047) (← links)
- Beyond degree choosability (Q2401410) (← links)
- A different short proof of Brooks' theorem (Q2509552) (← links)
- Painting squares in \(\Delta^2-1\) shades (Q2629492) (← links)
- Graphs with $\chi=\Delta$ Have Big Cliques (Q2949718) (← links)
- On hitting all maximum cliques with an independent set (Q3067059) (← links)
- On Graph Associations (Q3440270) (← links)
- Brooks' Theorem and Beyond (Q3466339) (← links)
- (Q3510977) (← links)
- A simple solution to the hardest logic puzzle ever (Q3521251) (← links)
- A Note On Reed's Conjecture (Q3629477) (← links)
- Extracting List Colorings from Large Independent Sets (Q4596317) (← links)
- Destroying Noncomplete Regular Components in Graph Partitions (Q4908827) (← links)
- The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4 (Q5232150) (← links)
- Coloring Claw-Free Graphs with $\Delta-1$ Colors (Q5300509) (← links)
- List-Coloring Claw-Free Graphs with $\Delta-1$ Colors (Q5346550) (← links)
- Short Fans and the 5/6 Bound for Line Graphs (Q5357961) (← links)
- Subcubic Edge‐Chromatic Critical Graphs Have Many Edges (Q5360879) (← links)
- Coloring Graphs with Dense Neighborhoods (Q5495890) (← links)
- Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors (Q6046645) (← links)
- Yet another proof of Brooks' theorem (Q6091817) (← links)
- The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree (Q6091818) (← links)
