23 citations · 60 across the 24 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015
Extracting list colorings from large independent sets
Hal Kierstead, Landon Rabern
We take an application of the Kernel Lemma by Kostochka and Yancey to its logical conclusion. The consequence is a sort of magical way to draw conclusions about list coloring (and…
math.CO2015★ 23 cited
First-fit coloring on interval graphs has performance ratio at least 5
H. A. Kierstead, David A. Smith, W. T. Trotter
First-fit is the online graph coloring algorithm that considers vertices one at a time in some order and assigns each vertex the least positive integer not used already on a neighb…