Heinz-Jürgen Voss

Discret. Math., 2013

2007

Hamilton cycles in prisms.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

The 7-cycle C7 is light in the family of planar graphs with minimum degree 5.

[BibT_eX]

[DOI]

Tomás Madaras

Riste Skrekovski

Discret. Math., 2007

2006

Circular mixed hypergraphs II: The upper chromatic number.

[BibT_eX]

[DOI]

Vitaly I. Voloshin

Discret. Appl. Math., 2006

Coloring mixed hypertrees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2005

A note on group colorings.

[BibT_eX]

[DOI]

Ondrej Pangrác

J. Graph Theory, 2005

Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2005

Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds.

[BibT_eX]

[DOI]

Eur. J. Comb., 2005

2004

Edge-disjoint odd cycles in planar graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2004

Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs.

[BibT_eX]

[DOI]

Vladimir P. Korzhik

J. Comb. Theory, Ser. B, 2004

Light classes of generalized stars in polyhedral maps on surfaces.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2004

Mixed hypercacti.

[BibT_eX]

[DOI]

Jan Kratochvíl

Discret. Math., 2004

2003

Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs.

[BibT_eX]

[DOI]

Jan Kratochvíl

Theor. Comput. Sci., 2003

Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9.

[BibT_eX]

[DOI]

Bojan Mohar

Riste Skrekovski

J. Graph Theory, 2003

Light subgraphs of order 4 in large maps of minimum degree 5 on compact 2-manifolds.

[BibT_eX]

[DOI]

Australas. J Comb., 2003

2002

Connected (g, f)-factors.

[BibT_eX]

[DOI]

Mark N. Ellingham

Yunsun Nam

J. Graph Theory, 2002

Exponential Families of Non-isomorphic Non-triangular Orientable Genus Embeddings of Complete Graphs.

[BibT_eX]

[DOI]

Vladimir P. Korzhik

J. Comb. Theory, Ser. B, 2002

Light Paths in Large Polyhedral Maps with Prescribed Minimum Degree.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2002

On k-trestles in polyhedreal graphs.

[BibT_eX]

[DOI]

Michal Tkác

Discuss. Math. Graph Theory, 2002

2001

On the Number of Nonisomorphic Orientable Regular Embeddings of Complete Graphs.

[BibT_eX]

[DOI]

Vladimir P. Korzhik

J. Comb. Theory, Ser. B, 2001

Circular and uniquely colorable mixed hypergraphs.

[BibT_eX]

[DOI]

Angela Niciilitsa

Vitaly I. Voloshin

Electron. Notes Discret. Math., 2001

Light subgraphs of multigraphs on compact 2-dimensional manifolds.

[BibT_eX]

[DOI]

Discret. Math., 2001

Complexity Note on Mixed Hypergraphs.

[BibT_eX]

[DOI]

Jan Kratochvíl

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

2000

Light subgraphs of multigraphs embedded in compact 2-manifolds.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

A local property of polyhedral maps on compact two-dimensional manifolds.

[BibT_eX]

[DOI]

Discret. Math., 2000

A characterization of uniquely colorable mixed hypergraphs of order n with upper chromatic numbers n-1 and n-2.

[BibT_eX]

[DOI]

Angela Niculitsa

Australas. J Comb., 2000

1999

A Local Property of Large Polyhedral Maps on Compact 2-Dimensional Manifolds.

[BibT_eX]

[DOI]

Graphs Comb., 1999

Subgraphs with Restricted Degrees of their Vertices in Large Polyhedral Maps on Compact Two-manifolds.

[BibT_eX]

[DOI]

Eur. J. Comb., 1999

1998

Sachs triangulations and infinite sequences of regular maps on given type.

[BibT_eX]

[DOI]

Discret. Math., 1998

1996

Short Disjoint Cycles in Graphs with Degree Constraints.

[BibT_eX]

[DOI]

Andreas Brandstädt

Discret. Appl. Math., 1996

1994

Sachs triangulations and regular maps.

[BibT_eX]

[DOI]

Jozef Sirán

Martin Skoviera

Discret. Math., 1994

1985

Chords of Circuits in Graphs with Given Minimum Degree.

[BibT_eX]

J. Inf. Process. Cybern., 1985

Independent sets in k-chromatic graphs.

[BibT_eX]

[DOI]

Comb., 1985

1982

Graphs having circuits with at least two chords.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1982

1980

Graphs Having Odd Circuits with at Least k Chords.

[BibT_eX]

J. Inf. Process. Cybern., 1980

1975

Reguläre Graphen gegebener Maximalkreislänge mit maximaler Knotenzahl.

[BibT_eX]