Reguläre Graphen gegebener Maximalkreislänge mit maximaler Knotenzahl. - Heinz-Jürgen Voss (J. Inf. Process. Cybern., 1975)

Graphs Having Odd Circuits with at Least k Chords. - Heinz-Jürgen Voss (J. Inf. Process. Cybern., 1980)

Graphs having circuits with at least two chords. - Heinz-Jürgen Voss (J. Comb. Theory B, 1982)

Independent sets in k-chromatic graphs. - Heinz-Jürgen Voss (Comb., 1985)

Chords of Circuits in Graphs with Given Minimum Degree. - Heinz-Jürgen Voss (J. Inf. Process. Cybern., 1985)

Sachs triangulations and regular maps. - Jozef Sirán; Martin Skoviera; Heinz-Jürgen Voss (Discret. Math., 1994)

Short Disjoint Cycles in Graphs with Degree Constraints. - Andreas Brandstädt; Heinz-Jürgen Voss (Discret. Appl. Math., 1996)

Sachs triangulations and infinite sequences of regular maps on given type. - Heinz-Jürgen Voss (Discret. Math., 1998)

Subgraphs with Restricted Degrees of their Vertices in Large Polyhedral Maps on Compact Two-manifolds. - Stanislav Jendrol'; Heinz-Jürgen Voss (Eur. J. Comb., 1999)

A Local Property of Large Polyhedral Maps on Compact 2-Dimensional Manifolds. - Stanislav Jendrol'; Heinz-Jürgen Voss (Graphs Comb., 1999)

A characterization of uniquely colorable mixed hypergraphs of order n with upper chromatic numbers n-1 and n-2. - Angela Niculitsa; Heinz-Jürgen Voss (Australas. J Comb., 2000)

A local property of polyhedral maps on compact two-dimensional manifolds. - Stanislav Jendrol'; Heinz-Jürgen Voss (Discret. Math., 2000)

Light subgraphs of multigraphs embedded in compact 2-manifolds. - Stanislav Jendrol'; Heinz-Jürgen Voss (Electron. Notes Discret. Math., 2000)

Complexity Note on Mixed Hypergraphs. - Daniel Král; Jan Kratochvíl; Heinz-Jürgen Voss (MFCS, 2001)

Light subgraphs of multigraphs on compact 2-dimensional manifolds. - Stanislav Jendrol'; Heinz-Jürgen Voss (Discret. Math., 2001)

Circular and uniquely colorable mixed hypergraphs. - Angela Niciilitsa; Vitaly I. Voloshin; Heinz-Jürgen Voss (Electron. Notes Discret. Math., 2001)

On the Number of Nonisomorphic Orientable Regular Embeddings of Complete Graphs. - Vladimir P. Korzhik; Heinz-Jürgen Voss (J. Comb. Theory B, 2001)

Light paths in large polyhedral maps with prescribed minimum degree. - Stanislav Jendrol'; Heinz-Jürgen Voss (Australas. J Comb., 2002)

On k-trestles in polyhedreal graphs. - Michal Tkác; Heinz-Jürgen Voss (Discuss. Math. Graph Theory, 2002)

Exponential Families of Non-isomorphic Non-triangular Orientable Genus Embeddings of Complete Graphs. - Vladimir P. Korzhik; Heinz-Jürgen Voss (J. Comb. Theory B, 2002)

Connected (g, f)-factors. - Mark N. Ellingham; Yunsun Nam; Heinz-Jürgen Voss (J. Graph Theory, 2002)

Light subgraphs of order 4 in large maps of minimum degree 5 on compact 2-manifolds. - Stanislav Jendrol'; Heinz-Jürgen Voss (Australas. J Comb., 2003)

Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9. - Bojan Mohar; Riste Skrekovski; Heinz-Jürgen Voss (J. Graph Theory, 2003)

Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs. - Daniel Král; Jan Kratochvíl; Heinz-Jürgen Voss (Theor. Comput. Sci., 2003)

Mixed hypercacti. - Daniel Král; Jan Kratochvíl; Heinz-Jürgen Voss (Discret. Math., 2004)

Light classes of generalized stars in polyhedral maps on surfaces. - Stanislav Jendrol'; Heinz-Jürgen Voss (Discuss. Math. Graph Theory, 2004)

Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs. - Vladimir P. Korzhik; Heinz-Jürgen Voss (J. Comb. Theory B, 2004)

Edge-disjoint odd cycles in planar graphs. - Daniel Král; Heinz-Jürgen Voss (J. Comb. Theory B, 2004)

Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds. - Stanislav Jendrol'; Heinz-Jürgen Voss (Eur. J. Comb., 2005)

Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds. - Stanislav Jendrol'; Heinz-Jürgen Voss (J. Comb. Theory B, 2005)

A note on group colorings. - Daniel Král; Ondrej Pangrác; Heinz-Jürgen Voss (J. Graph Theory, 2005)

Coloring mixed hypertrees. - Daniel Král; Jan Kratochvíl; Andrzej Proskurowski; Heinz-Jürgen Voss (Discret. Appl. Math., 2006)

Circular mixed hypergraphs II: The upper chromatic number. - Vitaly I. Voloshin; Heinz-Jürgen Voss (Discret. Appl. Math., 2006)

The 7-cycle C7 is light in the family of planar graphs with minimum degree 5. - Tomás Madaras; Riste Skrekovski; Heinz-Jürgen Voss (Discret. Math., 2007)

Hamilton cycles in prisms. - Tomás Kaiser; Zdenek Ryjácek; Daniel Král; Moshe Rosenfeld 001; Heinz-Jürgen Voss (J. Graph Theory, 2007)

Light subgraphs of graphs embedded in the plane - A survey. - Stanislav Jendrol'; Heinz-Jürgen Voss (Discret. Math., 2013)