The following pages link to Henry A. Kierstead (Q555495):
Displaying 50 items.
- On the Corrádi-Hajnal theorem and a question of Dirac (Q345076) (← links)
- On directed versions of the Corrádi-Hajnal corollary (Q404438) (← links)
- Adapted game colouring of graphs (Q412230) (← links)
- First-fit coloring on interval graphs has performance ratio at least 5 (Q499473) (← links)
- A refinement of a result of Corrádi and Hajnal (Q520047) (← links)
- First-fit coloring of bounded tolerance graphs (Q531602) (← links)
- A fast algorithm for equitable coloring (Q532129) (← links)
- Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture (Q555496) (← links)
- On First-Fit coloring of ladder-free posets (Q691598) (← links)
- On the choice number of complete multipartite graphs with part size four (Q739044) (← links)
- On the chromatic index of multigraphs without large triangles (Q794661) (← links)
- A new method of proving theorems on chromatic index (Q801928) (← links)
- The number of depth-first searches of an ordered set (Q909681) (← links)
- Planar graphs are 1-relaxed, 4-choosable (Q976159) (← links)
- Ore-type versions of Brooks' theorem (Q1003831) (← links)
- Inequalities for the greedy dimensions of ordered sets (Q1065837) (← links)
- The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\) (Q1078192) (← links)
- NP-completeness results concerning greedy and super greedy linear extensions (Q1087567) (← links)
- A Ramsey theoretic problem for finite ordered sets (Q1088690) (← links)
- A minimax theorem for chain complete ordered sets (Q1109795) (← links)
- Explicit matchings in the middle levels of the Boolean lattice (Q1117950) (← links)
- Applications of edge coloring of multigraphs to vertex coloring of graphs (Q1121898) (← links)
- A polynomial time approximation algorithm for dynamic storage allocation (Q1176726) (← links)
- Fibres and ordered set coloring (Q1177956) (← links)
- Colorful induced subgraphs (Q1197025) (← links)
- On-line coloring \(k\)-colorable graphs (Q1264277) (← links)
- The dimension of two levels of the Boolean lattice (Q1301734) (← links)
- An explicit 1-factorization in the middle of the Boolean lattice (Q1320401) (← links)
- The dimension of suborders of the Boolean lattice (Q1338128) (← links)
- The dimension of the finite subsets of \(\kappa\) (Q1354631) (← links)
- On-line coloring of perfect graphs (Q1375694) (← links)
- Classes of graphs that exclude a tree and a clique and are not vertex Ramsey (Q1375696) (← links)
- Square Hamiltonian cycles in graphs with maximal 4-cliques (Q1377856) (← links)
- Marking games and the oriented game chromatic number of partial \(k\)-trees (Q1396657) (← links)
- A simple competitive graph coloring algorithm. II. (Q1425110) (← links)
- Extending partial colorings of graphs (Q1567669) (← links)
- A simple competitive graph coloring algorithm (Q1569067) (← links)
- A note on graph pebbling (Q1606023) (← links)
- Chromatic numbers of exact distance graphs (Q1633747) (← links)
- Sharpening an ore-type version of the Corrádi-Hajnal theorem (Q1688267) (← links)
- The \((2k-1)\)-connected multigraphs with at most \(k-1\) disjoint cycles (Q1705804) (← links)
- (Q1753116) (redirect page) (← links)
- An easy subexponential bound for online chain partitioning (Q1753118) (← links)
- Explicit 2-factorizations of the odd graph (Q1765963) (← links)
- The dimension of cycle-free orders (Q1803661) (← links)
- Orderings on graphs and game coloring number (Q1826511) (← links)
- Some applications of Vizing's theorem to vertex colorings of graphs (Q1839256) (← links)
- 2-factors in dense bipartite graphs (Q1850018) (← links)
- A simple competitive graph coloring algorithm. III (Q1880795) (← links)
- Coloring with no 2-colored \(P_4\)'s (Q1883636) (← links)
