| 2007 |
|---|
| 29 | EE | Tomás Madaras,
Riste Skrekovski,
Heinz-Jürgen Voss:
The 7-cycle C7 is light in the family of planar graphs with minimum degree 5.
Discrete Mathematics 307(11-12): 1430-1435 (2007) |
| 28 | EE | Tomás Kaiser,
Zdenek Ryjácek,
Daniel Král,
Moshe Rosenfeld,
Heinz-Jürgen Voss:
Hamilton cycles in prisms.
Journal of Graph Theory 56(4): 249-269 (2007) |
| 2006 |
|---|
| 27 | EE | Daniel Král,
Jan Kratochvíl,
Andrzej Proskurowski,
Heinz-Jürgen Voss:
Coloring mixed hypertrees.
Discrete Applied Mathematics 154(4): 660-672 (2006) |
| 26 | EE | Vitaly I. Voloshin,
Heinz-Jürgen Voss:
Circular mixed hypergraphs II: The upper chromatic number.
Discrete Applied Mathematics 154(8): 1157-1172 (2006) |
| 2005 |
|---|
| 25 | EE | Stanislav Jendrol,
Heinz-Jürgen Voss:
Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds.
Eur. J. Comb. 26(3-4): 457-471 (2005) |
| 24 | EE | Stanislav Jendrol,
Heinz-Jürgen Voss:
Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds.
J. Comb. Theory, Ser. B 93(1): 1-21 (2005) |
| 23 | EE | Daniel Král,
Ondrej Pangrác,
Heinz-Jürgen Voss:
A note on group colorings.
Journal of Graph Theory 50(2): 123-129 (2005) |
| 2004 |
|---|
| 22 | EE | Daniel Král,
Jan Kratochvíl,
Heinz-Jürgen Voss:
Mixed hypercacti.
Discrete Mathematics 286(1-2): 99-113 (2004) |
| 21 | EE | Daniel Král,
Heinz-Jürgen Voss:
Edge-disjoint odd cycles in planar graphs.
J. Comb. Theory, Ser. B 90(1): 107-120 (2004) |
| 20 | EE | Vladimir P. Korzhik,
Heinz-Jürgen Voss:
Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs.
J. Comb. Theory, Ser. B 91(2): 253-287 (2004) |
| 2003 |
|---|
| 19 | EE | Daniel Král,
Jan Kratochvíl,
Heinz-Jürgen Voss:
Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs.
Theor. Comput. Sci. 295: 263-278 (2003) |
| 2002 |
|---|
| 18 | EE | Stanislav Jendrol,
Heinz-Jürgen Voss:
Light Paths in Large Polyhedral Maps with Prescribed Minimum Degree.
Electronic Notes in Discrete Mathematics 11: 386-409 (2002) |
| 17 | EE | Vladimir P. Korzhik,
Heinz-Jürgen Voss:
Exponential Families of Non-isomorphic Non-triangular Orientable Genus Embeddings of Complete Graphs.
J. Comb. Theory, Ser. B 86(1): 186-211 (2002) |
| 2001 |
|---|
| 16 | EE | Daniel Král,
Jan Kratochvíl,
Heinz-Jürgen Voss:
Complexity Note on Mixed Hypergraphs.
MFCS 2001: 474-486 |
| 15 | EE | Stanislav Jendrol,
Heinz-Jürgen Voss:
Light subgraphs of multigraphs on compact 2-dimensional manifolds.
Discrete Mathematics 233(1-3): 329-351 (2001) |
| 14 | EE | Angela Niciilitsa,
Vitaly I. Voloshin,
Heinz-Jürgen Voss:
Circular and uniquely colorable mixed hypergraphs.
Electronic Notes in Discrete Mathematics 8: 115-118 (2001) |
| 13 | EE | Vladimir P. Korzhik,
Heinz-Jürgen Voss:
On the Number of Nonisomorphic Orientable Regular Embeddings of Complete Graphs.
J. Comb. Theory, Ser. B 81(1): 58-76 (2001) |
| 2000 |
|---|
| 12 | EE | Daniel Král,
Jan Kratochvíl,
Andrzej Proskurowski,
Heinz-Jürgen Voss:
Coloring Mixed Hypertrees.
WG 2000: 279-289 |
| 11 | EE | Stanislav Jendrol,
Heinz-Jürgen Voss:
A local property of polyhedral maps on compact two-dimensional manifolds.
Discrete Mathematics 212(1-2): 111-120 (2000) |
| 10 | EE | Stanislav Jendrol,
Heinz-Jürgen Voss:
Light subgraphs of multigraphs embedded in compact 2-manifolds.
Electronic Notes in Discrete Mathematics 5: 189-192 (2000) |
| 1999 |
|---|
| 9 | EE | Stanislav Jendrol,
Heinz-Jürgen Voss:
Subgraphs with Restricted Degrees of their Vertices in Large Polyhedral Maps on Compact Two-manifolds.
Eur. J. Comb. 20(8): 821-832 (1999) |
| 1998 |
|---|
| 8 | EE | Heinz-Jürgen Voss:
Sachs triangulations and infinite sequences of regular maps on given type.
Discrete Mathematics 191(1-3): 223-240 (1998) |
| 1996 |
|---|
| 7 | EE | Andreas Brandstädt,
Heinz-Jürgen Voss:
Short Disjoint Cycles in Graphs with Degree Constraints.
Discrete Applied Mathematics 64(3): 197-205 (1996) |
| 1994 |
|---|
| 6 | EE | Jozef Sirán,
Martin Skoviera,
Heinz-Jürgen Voss:
Sachs triangulations and regular maps.
Discrete Mathematics 134(1-3): 161-175 (1994) |
| 1993 |
|---|
| 5 | | Andreas Brandstädt,
Heinz-Jürgen Voss:
Short Disjoint Cycles in Graphs with Degree Constraints.
WG 1993: 125-131 |
| 1985 |
|---|
| 4 | | Heinz-Jürgen Voss:
Independent sets in k-chromatic graphs.
Combinatorica 5(3): 261-269 (1985) |
| 3 | | Heinz-Jürgen Voss:
Chords of Circuits in Graphs with Given Minimum Degree.
Elektronische Informationsverarbeitung und Kybernetik 21(4/5): 201-208 (1985) |
| 1982 |
|---|
| 2 | EE | Heinz-Jürgen Voss:
Graphs having circuits with at least two chords.
J. Comb. Theory, Ser. B 32(3): 264-285 (1982) |
| 1980 |
|---|
| 1 | | Heinz-Jürgen Voss:
Graphs Having Odd Circuits with at Least k Chords.
Elektronische Informationsverarbeitung und Kybernetik 16(1-3): 77-86 (1980) |
