H. Kierstead

activity

19962026

most citedFirst-fit coloring on interval graphs has performance ratio at least 5

23 citations · 60 across the 24 of their papers we have counts for

collaborators

Showing 2014 · math.COShow all

3 papers · 2 filters

math.CO2014★ 3 cited

On the choice number of complete multipartite graphs with part size four

H. A. Kierstead, Andrew Salmon, Ran Wang

Let $ch (G)$ denote the choice number of a graph $G$ , and let $K_{s * k}$ be the complete $k$ -partite graph with $s$ vertices in each part. Erdős, Rubin, and Taylor showed th…

math.CO2014★ 5 cited

The (2k-1)-connected multigraphs with at most k-1 disjoint cycles

H. A. Kierstead, A. V. Kostochka, E. C. Yeager

In 1963, Corrádi and Hajnal proved that for all $k \geq 1$ and $n \geq 3 k$ , every (simple) graph on n vertices with minimum degree at least 2k contains k disjoint cycles. The same ye…

math.CO2014

Improved lower bounds on the number of edges in list critical and online list critical graphs

Hal Kierstead, Landon Rabern

We prove that every $k$ -list-critical graph ( $k \geq 7$ ) on $n \geq k + 2$ vertices has at least $\frac{1}{2} (k - 1 + \frac{k - 3}{( k - c ) ( k - 1 ) + k - 3}) n$ edges where $c = (k-3)\left(…