Research Output per year

## 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

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

Kierstead, H. & Rabern, L., Jan 1 2019, In : Journal of Combinatorial Theory. Series B.Research output: Contribution to journal › Article

Critical Graph

Lower bound

Degree Condition

Induced Subgraph

Graph in graph theory

## On coloring numbers of graph powers

Kierstead, H. A., Yang, D. & Yi, J., Jan 1 2019, (Accepted/In press) In : Discrete Mathematics. 111712.Research output: Contribution to journal › Article

Graph Powers

Coloring

Colouring

Graph in graph theory

Polynomials

## 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 proceeding › Chapter

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 journal › Article

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 journal › Article

Disjoint

Cycle

Graph in graph theory

Paul Adrien Maurice Dirac

Sufficient

## Projects 1996 2014

- 10 Finished

## Equitable Coloring Powers of Cycles and Grundy Number

DOD: National Security Agency (NSA)

2/16/12 → 5/15/14

Project: Research project

## Problems Related to Graph Packing

National Science Foundation (NSF)

6/15/09 → 5/31/12

Project: Research project

Graph Packing

Graph theory

Packing

Colouring

Graph in graph theory

## Generalized Graph Coloring

DOD: National Security Agency (NSA)

5/2/08 → 5/2/10

Project: Research project

## Competitive Graph Coloring and Related Problems

DOD: National Security Agency (NSA)

12/3/04 → 11/28/06

Project: Research project