The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jochen Harant: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jochen Harant, Anja Pruchnewski, Margit Voigt
    On Dominating Sets And Independent Sets Of Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1999, v:8, n:6, pp:- [Journal]
  2. Jochen Harant, Hansjoachim Walther
    A Lower Bound for the Shortness Coefficient of a Class of Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:103-105 [Journal]
  3. Tobias Gerlach, Frank Göring, Jochen Harant, Michal Tkác
    On cycles through specified vertices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:8-9, pp:831-835 [Journal]
  4. Frank Göring, Jochen Harant, Erhard Hexel, Zsolt Tuza
    On short cycles through prescribed vertices of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:286, n:1-2, pp:67-74 [Journal]
  5. Jochen Harant
    On paths and cycles through specified vertices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:286, n:1-2, pp:95-98 [Journal]
  6. Jochen Harant, Mirko Horák, Zdzislaw Skupien
    Separating 3-cycles in plane triangulations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:127-136 [Journal]
  7. Jochen Harant, Zdenek Ryjácek, Ingo Schiermeyer
    Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:193-201 [Journal]
  8. Jochen Harant, Ingo Schiermeyer
    On the independence number of a graph in terms of order and size. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:232, n:1-3, pp:131-138 [Journal]
  9. Tobias Gerlach, Jochen Harant
    On a cycle through a specified linear forest of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:892-895 [Journal]
  10. Jochen Harant, Stanislav Jendrol, Michal Tkác
    On 3-Connected Plane Graphs without Triangular Faces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:77, n:1, pp:150-161 [Journal]
  11. Jochen Harant, Hansjoachim Walther
    On the radius of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:113-117 [Journal]
  12. Thomas Böhme, Jochen Harant
    On Hamiltonian cycles in 4- and 5-connected plane triangulations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:25-30 [Journal]
  13. Thomas Böhme, Jochen Harant, Anja Pruchnewski, Ingo Schiermeyer
    A planarity criterion for cubic bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:31-43 [Journal]
  14. Jochen Harant
    A lower bound on the independence number of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:239-243 [Journal]
  15. Jochen Harant
    Toughness and nonhamiltonicity of polyhedral graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:113, n:1-3, pp:249-253 [Journal]
  16. Jochen Harant, Peter J. Owens
    Non-hamiltonian 4/5-tough maximal planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:301-305 [Journal]
  17. Jochen Harant, Peter J. Owens, Michal Tkác, Hansjoachim Walther
    5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:143-153 [Journal]
  18. Jochen Harant
    An upper bound for the radius of a 3-connected graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:335-341 [Journal]

  19. The independence number in graphs of maximum degree three. [Citation Graph (, )][DBLP]


  20. A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs. [Citation Graph (, )][DBLP]


  21. Domination in bipartite graphs. [Citation Graph (, )][DBLP]


  22. Packing disjoint cycles over vertex cuts. [Citation Graph (, )][DBLP]


  23. Packing edge-disjoint cycles in graphs and the cyclomatic number. [Citation Graph (, )][DBLP]


  24. Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
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