• 1657 Citations
  • 22 h-Index
1981 …2019
If you made any changes in Pure, your changes will be visible here soon.

Personal profile

Education/Academic qualification

PHD, University of California-San Diego

… → 1979

MA, University of California-San Diego

… → 1975

BS, University of California-San Diego

… → 1973

Fingerprint Dive into the research topics where Henry Kierstead is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

  • 2 Similar Profiles
Coloring Engineering & Materials Science
Colouring Mathematics
Graph in graph theory Mathematics
Graph Coloring Mathematics
Ordered Set Mathematics
Game Chromatic number Mathematics
Game Mathematics
Equitable Coloring Mathematics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 1981 2019

  • 1657 Citations
  • 22 h-Index
  • 106 Article
  • 2 Chapter
  • 2 Conference contribution
Critical Graph
Lower bound
Degree Condition
Induced Subgraph
Graph in graph theory

An algorithmic answer to the ore-type version of Dirac’s question on disjoint cycles

Kierstead, H., Kostochka, A. V., Molla, T. & Yager, D., Jan 1 2018, Springer Optimization and Its Applications. Springer International Publishing, p. 149-168 20 p. (Springer Optimization and Its Applications; vol. 139).

Research output: Chapter in Book/Report/Conference proceedingChapter

Paul Adrien Maurice Dirac
Disjoint
Multigraph
Cycle
Minimum Degree

An easy subexponential bound for online chain partitioning

Bosek, B., Krawczyk, T., Kierstead, H., Matecki, G. & Smith, M. E., May 25 2018, In : Electronic Journal of Combinatorics. 25, 2, #P2.28.

Research output: Contribution to journalArticle

Ladders
Poset
Partitioning
Online Algorithms

A Sharp Dirac–Erdős Type Bound for Large Graphs

Kierstead, H., KOSTOCHKA, A. V. & McCONVEY, A., Mar 9 2018, (Accepted/In press) In : Combinatorics Probability and Computing. p. 1-11 11 p.

Research output: Contribution to journalArticle

Disjoint
Cycle
Graph in graph theory
Paul Adrien Maurice Dirac
Sufficient

Chromatic numbers of exact distance graphs

van den Heuvel, J., Kierstead, H. & Quiroz, D. A., Jan 1 2018, (Accepted/In press) In : Journal of Combinatorial Theory. Series B.

Research output: Contribution to journalArticle

Distance Graph
Coloring
Chromatic number
Colouring
Graph in graph theory

Projects 1996 2014