| 2008 |
|---|
| 19 | EE | Jan Hladký,
Daniel Král,
Jean-Sébastien Sereni,
Michael Stiebitz:
List colorings with measurable sets.
Journal of Graph Theory 59(3): 229-238 (2008) |
| 2006 |
|---|
| 18 | EE | Michael Stiebitz,
Riste Skrekovski:
A map colour theorem for the union of graphs.
J. Comb. Theory, Ser. B 96(1): 20-37 (2006) |
| 2005 |
|---|
| 17 | EE | V. A. Aksionov,
Oleg V. Borodin,
Leonid S. Melnikov,
Gert Sabidussi,
Michael Stiebitz,
Bjarne Toft:
Deeply asymmetric planar graphs.
J. Comb. Theory, Ser. B 95(1): 68-78 (2005) |
| 16 | EE | Zoltán Füredi,
Alexandr V. Kostochka,
Riste Skrekovski,
Michael Stiebitz,
Douglas B. West:
Nordhaus-Gaddum-type Theorems for decompositions into many parts.
Journal of Graph Theory 50(4): 273-292 (2005) |
| 2004 |
|---|
| 15 | EE | Thomas Böhme,
Bojan Mohar,
Riste Skrekovski,
Michael Stiebitz:
Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs.
Journal of Graph Theory 45(4): 270-274 (2004) |
| 14 | EE | András Gyárfás,
T. Jensen,
Michael Stiebitz:
On graphs with strongly independent color-classes.
Journal of Graph Theory 46(1): 1-14 (2004) |
| 2003 |
|---|
| 13 | EE | Alexandr V. Kostochka,
Michael Stiebitz:
A new lower bound on the number of edges in colour-critical graphs and hypergraphs.
J. Comb. Theory, Ser. B 87(2): 374-402 (2003) |
| 2000 |
|---|
| 12 | EE | Alexandr V. Kostochka,
Michael Stiebitz:
On the Number of Edges in Colour-Critical Graphs and Hypergraphs.
Combinatorica 20(4): 521-530 (2000) |
| 1998 |
|---|
| 11 | EE | Alexandr V. Kostochka,
Michael Stiebitz:
Colour-critical graphs with few edges.
Discrete Mathematics 191(1-3): 125-137 (1998) |
| 1997 |
|---|
| 10 | EE | Thomas Böhme,
Hajo Broersma,
F. Göbel,
Alexandr V. Kostochka,
Michael Stiebitz:
Spanning trees with pairwise nonadjacent endvertices.
Discrete Mathematics 170(1-3): 219-222 (1997) |
| 1996 |
|---|
| 9 | EE | Alexandr V. Kostochka,
Michael Stiebitz,
B. Wirth:
The colour theorems of Brooks and Gallai extended.
Discrete Mathematics 162(1-3): 299-303 (1996) |
| 1995 |
|---|
| 8 | EE | Michael Stiebitz,
Bjarne Toft:
An Abstract Generalization of a Map Reduction Theorem of Birkhoff.
J. Comb. Theory, Ser. B 65(2): 165-185 (1995) |
| 1992 |
|---|
| 7 | EE | Michael Stiebitz:
On Hadwiger's number - a problem of the Nordhaus-Gaddum type.
Discrete Mathematics 101(1-3): 307-317 (1992) |
| 6 | EE | Herbert Fleischner,
Michael Stiebitz:
A solution to a colouring problem of P. Erdös.
Discrete Mathematics 101(1-3): 39-48 (1992) |
| 5 | | U. Hendrich,
Michael Stiebitz:
On the Bandwidth of Graph Products.
Elektronische Informationsverarbeitung und Kybernetik 28(3): 113-125 (1992) |
| 1989 |
|---|
| 4 | EE | Horst Sachs,
Michael Stiebitz:
On constructive methods in the theory of colour-critical graphs.
Discrete Mathematics 74(1-2): 201-226 (1989) |
| 1987 |
|---|
| 3 | | Michael Stiebitz:
Subgraphs of color-critical graphs.
Combinatorica 7(3): 303-312 (1987) |
| 2 | EE | Michael Stiebitz:
K5 is the only double-critical 5-chromatic graph.
Discrete Mathematics 64(1): 91-93 (1987) |
| 1982 |
|---|
| 1 | | Michael Stiebitz:
Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs.
Combinatorica 2(3): 315-323 (1982) |
