default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHeinz-Jürgen Voss
Person information
- affiliation: TU Dresden, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j36]Stanislav Jendrol'
, Heinz-Jürgen Voss:
Light subgraphs of graphs embedded in the plane - A survey. Discret. Math. 313(4): 406-421 (2013)
2000 – 2009
- 2007
- [j35]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. Discret. Math. 307(11-12): 1430-1435 (2007) - [j34]Tomás Kaiser, Zdenek Ryjácek, Daniel Král, Moshe Rosenfeld, Heinz-Jürgen Voss:
Hamilton cycles in prisms. J. Graph Theory 56(4): 249-269 (2007) - 2006
- [j33]Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss:
Coloring mixed hypertrees. Discret. Appl. Math. 154(4): 660-672 (2006) - [j32]Vitaly I. Voloshin, Heinz-Jürgen Voss:
Circular mixed hypergraphs II: The upper chromatic number. Discret. Appl. Math. 154(8): 1157-1172 (2006) - 2005
- [j31]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) - [j30]Stanislav Jendrol', Heinz-Jürgen Voss:
Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds. J. Comb. Theory B 93(1): 1-21 (2005) - [j29]Daniel Král, Ondrej Pangrác, Heinz-Jürgen Voss:
A note on group colorings. J. Graph Theory 50(2): 123-129 (2005) - 2004
- [j28]Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss:
Mixed hypercacti. Discret. Math. 286(1-2): 99-113 (2004) - [j27]Stanislav Jendrol', Heinz-Jürgen Voss:
Light classes of generalized stars in polyhedral maps on surfaces. Discuss. Math. Graph Theory 24(1): 85-107 (2004) - [j26]Daniel Král, Heinz-Jürgen Voss:
Edge-disjoint odd cycles in planar graphs. J. Comb. Theory B 90(1): 107-120 (2004) - [j25]Vladimir P. Korzhik, Heinz-Jürgen Voss:
Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs. J. Comb. Theory B 91(2): 253-287 (2004) - 2003
- [j24]Stanislav Jendrol', Heinz-Jürgen Voss:
Light subgraphs of order 4 in large maps of minimum degree 5 on compact 2-manifolds. Australas. J Comb. 28: 171-200 (2003) - [j23]Bojan Mohar, Riste Skrekovski, Heinz-Jürgen Voss:
Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9. J. Graph Theory 44(4): 261-295 (2003) - [j22]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
- [j21]Stanislav Jendrol', Heinz-Jürgen Voss:
Light paths in large polyhedral maps with prescribed minimum degree. Australas. J Comb. 25: 79-102 (2002) - [j20]Michal Tkác, Heinz-Jürgen Voss:
On k-trestles in polyhedreal graphs. Discuss. Math. Graph Theory 22(1): 193-198 (2002) - [j19]Stanislav Jendrol', Heinz-Jürgen Voss:
Light Paths in Large Polyhedral Maps with Prescribed Minimum Degree. Electron. Notes Discret. Math. 11: 386-409 (2002) - [j18]Vladimir P. Korzhik, Heinz-Jürgen Voss:
Exponential Families of Non-isomorphic Non-triangular Orientable Genus Embeddings of Complete Graphs. J. Comb. Theory B 86(1): 186-211 (2002) - [j17]Mark N. Ellingham, Yunsun Nam, Heinz-Jürgen Voss:
Connected (g, f)-factors. J. Graph Theory 39(1): 62-75 (2002) - 2001
- [j16]Stanislav Jendrol', Heinz-Jürgen Voss:
Light subgraphs of multigraphs on compact 2-dimensional manifolds. Discret. Math. 233(1-3): 329-351 (2001) - [j15]Angela Niciilitsa, Vitaly I. Voloshin, Heinz-Jürgen Voss:
Circular and uniquely colorable mixed hypergraphs. Electron. Notes Discret. Math. 8: 115-118 (2001) - [j14]Vladimir P. Korzhik, Heinz-Jürgen Voss:
On the Number of Nonisomorphic Orientable Regular Embeddings of Complete Graphs. J. Comb. Theory B 81(1): 58-76 (2001) - [c3]Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss:
Complexity Note on Mixed Hypergraphs. MFCS 2001: 474-486 - 2000
- [j13]Angela Niculitsa, Heinz-Jürgen Voss:
A characterization of uniquely colorable mixed hypergraphs of order n with upper chromatic numbers n-1 and n-2. Australas. J Comb. 21: 167-178 (2000) - [j12]Stanislav Jendrol', Heinz-Jürgen Voss:
A local property of polyhedral maps on compact two-dimensional manifolds. Discret. Math. 212(1-2): 111-120 (2000) - [j11]Stanislav Jendrol', Heinz-Jürgen Voss:
Light subgraphs of multigraphs embedded in compact 2-manifolds. Electron. Notes Discret. Math. 5: 189-192 (2000) - [c2]Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss:
Coloring Mixed Hypertrees. WG 2000: 279-289
1990 – 1999
- 1999
- [j10]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) - [j9]Stanislav Jendrol', Heinz-Jürgen Voss:
A Local Property of Large Polyhedral Maps on Compact 2-Dimensional Manifolds. Graphs Comb. 15(3): 303-313 (1999) - 1998
- [j8]Heinz-Jürgen Voss:
Sachs triangulations and infinite sequences of regular maps on given type. Discret. Math. 191(1-3): 223-240 (1998) - 1996
- [j7]Andreas Brandstädt, Heinz-Jürgen Voss:
Short Disjoint Cycles in Graphs with Degree Constraints. Discret. Appl. Math. 64(3): 197-205 (1996) - 1994
- [j6]Jozef Sirán, Martin Skoviera, Heinz-Jürgen Voss:
Sachs triangulations and regular maps. Discret. Math. 134(1-3): 161-175 (1994) - 1993
- [c1]Andreas Brandstädt, Heinz-Jürgen Voss:
Short Disjoint Cycles in Graphs with Degree Constraints. WG 1993: 125-131
1980 – 1989
- 1985
- [j5]Heinz-Jürgen Voss:
Independent sets in k-chromatic graphs. Comb. 5(3): 261-269 (1985) - [j4]Heinz-Jürgen Voss:
Chords of Circuits in Graphs with Given Minimum Degree. J. Inf. Process. Cybern. 21(4/5): 201-208 (1985) - 1982
- [j3]Heinz-Jürgen Voss:
Graphs having circuits with at least two chords. J. Comb. Theory B 32(3): 264-285 (1982) - 1980
- [j2]Heinz-Jürgen Voss:
Graphs Having Odd Circuits with at Least k Chords. J. Inf. Process. Cybern. 16(1-3): 77-86 (1980)
1970 – 1979
- 1975
- [j1]Heinz-Jürgen Voss:
Reguläre Graphen gegebener Maximalkreislänge mit maximaler Knotenzahl. J. Inf. Process. Cybern. 11(10-12): 580-581 (1975)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
