| 2009 |
|---|
| 22 | EE | Anja Pruchnewski,
Margit Voigt:
Precoloring extension for K4-minor-free graphs.
Journal of Graph Theory 60(4): 284-294 (2009) |
| 2007 |
|---|
| 21 | EE | Margit Voigt:
A non-3-choosable planar graph without cycles of length 4 and 5.
Discrete Mathematics 307(7-8): 1013-1015 (2007) |
| 20 | EE | Gábor Bacsó,
Zsolt Tuza,
Margit Voigt:
Characterization of graphs dominated by induced paths.
Discrete Mathematics 307(7-8): 822-826 (2007) |
| 19 | EE | Margit Voigt:
Precoloring Extension for 2-connected Graphs.
SIAM J. Discrete Math. 21(1): 258-263 (2007) |
| 2006 |
|---|
| 18 | EE | Margit Voigt:
List colourings of planar graphs.
Discrete Mathematics 306(10-11): 1076-1079 (2006) |
| 2005 |
|---|
| 17 | EE | Anja Kohl,
Jens Schreyer,
Zsolt Tuza,
Margit Voigt:
List version of L(d, s)-labelings.
Theor. Comput. Sci. 349(1): 92-98 (2005) |
| 2002 |
|---|
| 16 | EE | Jan Kratochvíl,
Zsolt Tuza,
Margit Voigt:
On the b-Chromatic Number of Graphs.
WG 2002: 310-320 |
| 15 | EE | Margit Voigt,
Hansjoachim Walther:
Polyhedral graphs with restricted number of faces of the same type.
Discrete Mathematics 244(1-3): 473-478 (2002) |
| 14 | EE | Zsolt Tuza,
Margit Voigt:
A note on planar 5-list colouring: non-extendability at distance 4.
Discrete Mathematics 251(1-3): 169-172 (2002) |
| 13 | EE | Imre Z. Ruzsa,
Zsolt Tuza,
Margit Voigt:
Distance Graphs with Finite Chromatic Number.
J. Comb. Theory, Ser. B 85(1): 181-187 (2002) |
| 2000 |
|---|
| 12 | | Margit Voigt:
Algorithmic Aspects Of Partial List Colourings.
Combinatorics, Probability & Computing 9(4): (2000) |
| 11 | EE | Ingo Schiermeyer,
Zsolt Tuza,
Margit Voigt:
On-line rankings of graphs.
Discrete Mathematics 212(1-2): 141-147 (2000) |
| 1999 |
|---|
| 10 | | Margit Voigt:
Colouring of distance graphs.
Ars Comb. 52: (1999) |
| 9 | | Jochen Harant,
Anja Pruchnewski,
Margit Voigt:
On Dominating Sets And Independent Sets Of Graphs.
Combinatorics, Probability & Computing 8(6): (1999) |
| 1998 |
|---|
| 8 | EE | Jan Kratochvíl,
Zsolt Tuza,
Margit Voigt:
Complexity of choosing subsets from color sets.
Discrete Mathematics 191(1-3): 139-148 (1998) |
| 7 | EE | Peter Mihók,
Jozef Bucko,
Margit Voigt:
On uniquely partitionable planar graphs.
Discrete Mathematics 191(1-3): 149-158 (1998) |
| 1997 |
|---|
| 6 | EE | Zsolt Tuza,
Margit Voigt:
List Colorings and Reducibility.
Discrete Applied Mathematics 79(1-3): 247-256 (1997) |
| 5 | EE | Noga Alon,
Zsolt Tuza,
Margit Voigt:
Choosability and fractional chromatic numbers.
Discrete Mathematics 165-166: 31-38 (1997) |
| 1995 |
|---|
| 4 | EE | Margit Voigt:
A not 3-choosable planar graph without 3-cycles.
Discrete Mathematics 146(1-3): 325-328 (1995) |
| 1994 |
|---|
| 3 | EE | Margit Voigt,
Hansjoachim Walther:
Chromatic Number of Prime Distance Graphs.
Discrete Applied Mathematics 51(1-2): 197-209 (1994) |
| 1993 |
|---|
| 2 | EE | Margit Voigt:
List colourings of planar graphs.
Discrete Mathematics 120(1-3): 215-219 (1993) |
| 1992 |
|---|
| 1 | | Margit Voigt:
On the Chromatic Number of Distance Graphs.
Elektronische Informationsverarbeitung und Kybernetik 28(1): 21-28 (1992) |
