E-LIB Suche - Ergebnisse für: Kierstead, Henry A.

1

The (2k-1)-connected multigraphs with at most k-1 disjoint ..:

Kierstead, Henry A. ; Kostochka, Alexandr V. ; Yeager, Elyse C.
Combinatorica. 37 (2015) 1 - p. 77-86 , 2015

Link: https://doi.org/10.1007/..

2

A fast algorithm for equitable coloring:

Kierstead, Henry A. ; Kostochka, Alexandr V. ; Mydlarz, Marcelo.
Combinatorica. 30 (2010) 2 - p. 217-224 , 2010

Link: https://doi.org/10.1007/..

3

Equitable versus nearly equitable coloring and the Chen-Lih..:

Kierstead, Henry A. ; Kostochka, Alexandr V.
Combinatorica. 30 (2010) 2 - p. 201-216 , 2010

Link: https://doi.org/10.1007/..

4

On-Line and First-fit Coloring of Graphs that Do Not Induce..:

Kierstead, Henry A. ; Penrice, Stephen G. ; Trotter, William T.
SIAM Journal on Discrete Mathematics. 8 (1995) 4 - p. 485-498 , 1995

Link: https://doi.org/10.1137/..

5

Hypergraphs With Finitely Many Isomorphism Subtypes:

Kierstead, Henry A. ; Nyikos, Peter J.
Transactions of the American Mathematical Society. 312 (1989) 2 - p. 699-718 , 1989

Link: https://www.jstor.org/st..

6

On Π1-Automorphism of Recursive Linear Orders:

Kierstead, Henry A.
The Journal of Symbolic Logic. 52 (1987) 3 - p. 681-688 , 1987

Link: https://www.jstor.org/st..

7

NP-Completeness results concerning greedy and super greedy ..:

Kierstead, Henry A.
Order. 3 (1986) 2 - p. 123-134 , 1986

Link: https://doi.org/10.1007/..

8

The chromatic number of graphs which induce neither K1,3 no..:

Kierstead, Henry A ; Schmerl, James H
Discrete Mathematics. 58 (1986) 3 - p. 253-262 , 1986

Link: https://doi.org/10.1016/..

9

Inequalities for the greedy dimensions of ordered sets:

Kierstead, Henry A. ; Trotter Jr., William T.
Order. 2 (1985) 2 - p. 145-164 , 1985

Link: https://doi.org/10.1007/..

10

A theory of recursive dimension for ordered sets:

Kierstead, Henry A. ; McNulty, George F. ; Trotter Jr., William T.
Order. 1 (1984) 1 - p. 67-82 , 1984

Link: https://doi.org/10.1007/..

11

On the chromatic index of multigraphs without large triangl..:

Kierstead, Henry A
Journal of Combinatorial Theory, Series B. 36 (1984) 2 - p. 156-160 , 1984

Link: https://doi.org/10.1016/..

12

Some applications of Vizing's theorem to vertex colorings o..:

Kierstead, Henry A. ; Schmerl, James H.
Discrete Mathematics. 45 (1983) 2-3 - p. 277-285 , 1983

Link: https://doi.org/10.1016/..

13

An Effective Version of Hall's Theorem:

Kierstead, Henry A.
Proceedings of the American Mathematical Society. 88 (1983) 1 - p. 124-128 , 1983

Link: https://www.jstor.org/st..

14

An Effective Version of Dilworth's Theorem:

Kierstead, Henry A.
Transactions of the American Mathematical Society. 268 (1981) 1 - p. 63-77 , 1981

Link: https://www.jstor.org/st..

15

Countable models of ω1-categorical theories in admissible l..:

Kierstead, Henry A.
Annals of Mathematical Logic. 19 (1980) 1-2 - p. 127-175 , 1980

Link: https://doi.org/10.1016/..