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

28 papers

math.CO2026

The Hajnal-Szemerédi theorem in digraphs revisited

Louis DeBiasio, Hal Kierstead

Treglown conjectured (in a complementary form) that for every positive integer $k$ , every digraph $D$ satisfying $min {d^{+} (v), d^{-} (v)} \leq k - 1$ for all $v \in V (D)$ has an equitable…

math.CO2026

An introduction to equitable DP coloring of graphs

H. A. Kierstead, Alexandr Kostochka, Zimu Xiang

A proper $k$ -coloring of vertices of an $n$ -vertex graph is equitable if the size of every color class is $⌊ n / k ⌋$ or $⌈ n / k ⌉$ . An extension of it to list col…

math.CO2025

Results and Problems on Equitable Coloring of Graphs

H. A. Kierstead, Alexandr Kostochka, Zimu Xiang

A proper coloring of vertices of a graph is equitable if the sizes of any two color classes differ by at most 1. Such colorings have many applications and are interesting by themse…

math.CO2024

Equitable list coloring of sparse graphs

H. A. Kierstead, Alexandr Kostochka, Zimu Xiang

A proper vertex coloring of a graph is equitable if the sizes of all color classes differ by at most $1$ . For a list assignment $L$ of $k$ colors to each vertex of an $n$ -vertex gr…

math.CO2023

Equitable list coloring of planar graphs with given maximum degree

H. A. Kierstead, Alexandr Kostochka, Zimu Xiang

If $L$ is a list assignment of $r$ colors to each vertex of an $n$ -vertex graph $G$ , then an equitable $L$ -coloring of $G$ is a proper coloring of vertices of $G$ from their lists…

math.CO2023★ 1 cited

Improved upper bounds on longest-path and maximal subdivision transversals

Henry Kierstead, Eric Ren

Let $G$ be a connected graph on $n$ vertices. The Gallai number $G a l (G)$ of $G$ is the size of the smallest set of vertices that meets every maximum path in $G$ . Grünbaum construct…