Henry A. Kierstead

Affiliations: 
Arizona State University, Tempe, AZ, United States 
Area:
Mathematics
Google:
"Henry Kierstead"
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Kierstead HA, Kostochka AV, McConvey A. (2018) A Sharp Dirac–Erdős Type Bound for Large Graphs Combinatorics, Probability & Computing. 27: 387-397
Kierstead H, Kostochka AV, Molla T, et al. (2017) Sharpening an Ore-type version of the Corrádi–Hajnal theorem Abhandlungen Aus Dem Mathematischen Seminar Der Universitat Hamburg. 87: 299-335
Kierstead HA, Kostochka AV, McConvey A. (2017) Strengthening theorems of Dirac and Erdős on disjoint cycles Journal of Graph Theory. 85: 788-802
Kierstead HA, Salmon A, Wang R. (2016) On the choice number of complete multipartite graphs with part size four European Journal of Combinatorics. 58: 1-16
Kierstead HA, Smith DA, Trotter WT. (2016) First-fit coloring on interval graphs has performance ratio at least 5 European Journal of Combinatorics. 51: 236-254
Czygrinow A, Debiasio L, Kierstead HA, et al. (2015) An Extension of the Hajnal-Szemerédi Theorem to Directed Graphs Combinatorics Probability and Computing. 24: 754-773
Haxell PE, Kierstead HA. (2015) Edge coloring multigraphs without small dense subsets Discrete Mathematics. 338: 2502-2506
Kierstead HA, Lidický B. (2015) On choosability with separation of planar graphs with lists of different sizes Discrete Mathematics. 338: 1779-1783
Kierstead HA, Kostochka AV, Yeager EC. (2015) The (2k-1)-connected multigraphs with at most k-1 disjoint cycles Combinatorica
Kierstead HA, Kostochka AV, Yeager EC. (2014) On the Corrádi-Hajnal theorem and a question of Dirac Journal of Combinatorial Theory. Series B
See more...