Articles with public access mandates - H. A. KiersteadLearn more
Available somewhere: 9
First-fit coloring on interval graphs has performance ratio at least 5
HA Kierstead, DA Smith, WT Trotter
European Journal of Combinatorics 51, 236-254, 2016
Mandates: US National Science Foundation
On the Corrádi–Hajnal theorem and a question of Dirac
HA Kierstead, AV Kostochka, EC Yeager
Journal of Combinatorial Theory, Series B 122, 121-148, 2017
Mandates: US National Science Foundation
Sharpening an Ore-type version of the Corrádi–Hajnal theorem
HA Kierstead, AV Kostochka, T Molla, EC Yeager
Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 87, 299-335, 2017
Mandates: US National Science Foundation
The (2k-1)-connected multigraphs with at most k-1 disjoint cycles
HA Kierstead, AV Kostochka, EC Yeager
Combinatorica 37, 77-86, 2017
Mandates: US National Science Foundation
Edge coloring multigraphs without small dense subsets
PE Haxell, HA Kierstead
Discrete Mathematics 338 (12), 2502-2506, 2015
Mandates: Natural Sciences and Engineering Research Council of Canada
Strengthening theorems of Dirac and Erdős on disjoint cycles
HA Kierstead, AV Kostochka, A McConvey
Journal of Graph Theory 85 (4), 788-802, 2017
Mandates: US National Science Foundation, US Department of Defense
3‐Degenerate induced subgraph of a planar graph
Y Gu, HA Kierstead, S Oum, H Qi, X Zhu
Journal of Graph Theory 99 (2), 251-277, 2022
Mandates: National Natural Science Foundation of China
A Sharp Dirac–Erdős Type Bound for Large Graphs
HA Kierstead, AV Kostochka, A McConvey
Combinatorics, Probability and Computing 27 (3), 387-397, 2018
Mandates: US National Science Foundation
An algorithmic answer to the Ore-type version of Dirac’s question on disjoint cycles
HA Kierstead, AV Kostochka, T Molla, D Yager
Optimization Problems in Graph Theory: In Honor of Gregory Z. Gutin's 60th …, 2018
Mandates: US National Science Foundation
Publication and funding information is determined automatically by a computer program