Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Kierstead, H.A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Equitable list coloring of graphs with bounded degree
H.A. Kierstead
,
A.V. Kostochka
Journal of Graph Theory
74
(3), 2013, pp. 309-334
Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring
H.A. Kierstead
,
A.V. Kostochka
Journal of Graph Theory
71
(1), 2012, pp. 31-48
A note on relaxed equitable coloring of graphs
Hao Fan
,
H.A. Kierstead
,
Guizhen Liu
,
Theodore Molla
,
Jian-Liang Wu
,
Xin Zhang
Information Processing Letters
111
(21-22), 2011, pp. 1062-1066
2-factors of bipartite graphs with asymmetric minimum degrees
Andrzej Czygrinow
,
Louis DeBiasio
,
H.A. Kierstead
SIAM Journal on Discrete Mathematics
24
(2), 2010, pp. 486-504
Coloring number and on-line Ramsey theory for graphs and hypergraphs
H.A. Kierstead
,
Goran Konjevod
Combinatorica
29
(1), 2009, pp. 49-64
Ore-type versions of Brooks' theorem
H.A. Kierstead
,
A.V. Kostochka
Journal of Combinatorial Theory Series B
99
(2), 2009, pp. 298-305
Star coloring bipartite planar graphs
H.A. Kierstead
,
André Kündgen
,
Craig Timmons
Journal of Graph Theory
60
(1), 2009, pp. 1-10
An Ore-type theorem on equitable coloring
H.A. Kierstead
,
A.V. Kostochka
Journal of Combinatorial Theory Series B
98
(1), 2008, pp. 226-234
Dominating sets in
k
-majority tournaments
Noga Alon
,
Graham Brightwell
,
H.A. Kierstead
,
A.V. Kostochka
,
Peter Winkler
Journal of Combinatorial Theory Series B
96
(3), 2006, pp. 374-387
Asymmetric graph coloring games
H.A. Kierstead
Journal of Graph Theory
48
(3), 2005, pp. 169-185
A simple competitive graph coloring algorithm II
Charles Dunn
,
H.A. Kierstead
Journal of Combinatorial Theory Series B
90
(1), 2004, pp. 93-106
A simple competitive graph coloring algorithm III
Charles Dunn
,
H.A. Kierstead
Journal of Combinatorial Theory Series B
92
(1), 2004, pp. 137-150
Radius three trees in graphs with large chromatic number
H.A. Kierstead
,
Yingxian Zhu
SIAM Journal on Discrete Mathematics
17
(4), 2004, pp. 571-581
Marking games and the oriented game chromatic number of partial
k
-trees
H.A. Kierstead
,
Zs. Tuza
Graphs and Combinatorics
19
(1), 2003, pp. 121-129
A note on graph pebbling
Andrzej Czygrinow
,
Glenn Hurlbert
,
H.A. Kierstead
,
William T. Trotter
Graphs and Combinatorics
18
(2), 2002, pp. 219-225
A simple competitive graph coloring algorithm
H.A. Kierstead
Journal of Combinatorial Theory Series B
78
(1), 2000, pp. 57-68
Hamiltonian chains in hypergraphs
Gyula Y. Katona
,
H.A. Kierstead
Journal of Graph Theory
30
(3), 1999, pp. 205-212
On
k
-ordered Hamiltonian graphs
H.A. Kierstead
,
G.N. Sárközy
,
S.M. Selkow
Journal of Graph Theory
32
(1), 1999, pp. 17-25
Classes of graphs that are not vertex Ramsey
H.A. Kierstead
SIAM Journal on Discrete Mathematics
10
(3), 1997, pp. 373-380
Hamiltonian square-paths
Genghua Fan
,
H.A. Kierstead
Journal of Combinatorial Theory Series B
67
(2), 1996, pp. 167-182
Paritioning a graph into two square-cycles
Genghua Fan
,
H.A. Kierstead
Journal of Graph Theory
23
(3), 1996, pp. 241-256
On-line coloring of perfect graphs
H.A. Kierstead
,
K. Kolossa
Combinatorica
16
(4), 1996, pp. 479-491
Classes of graphs that exclude a tree and a clique and are not vertex Ramsey
H.A. Kierstead
,
Yingxian Zhu
Combinatorica
16
(4), 1996, pp. 493-504
On the order dimension of 1-sets versus
k
-sets
H.A. Kierstead
Journal of Combinatorial Theory Series A
73
(2), 1996, pp. 219-228
The square of paths and cycles
Genghua Fan
,
H.A. Kierstead
Journal of Combinatorial Theory Series B
63
(1), 1995, pp. 55-64
Seiten 1
2
>