The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Heinz-Jürgen Voss: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.002secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002