The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Günter Schaar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Günter Schaar
    Remarks on Hamiltonian Properties of Powers of Digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:181-186 [Journal]
  2. Antoni Marczyk, Günter Schaar
    On traceable powers of digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:121-128 [Journal]
  3. Günter Schaar
    On special numberings of hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:261-268 [Journal]
  4. Günter Schaar, Zdzislaw Skupien
    Pairs of trees in tree-tree triangulations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1499-1505 [Journal]
  5. Günter Schaar
    On k-Path Traceable Graphs. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1988, v:24, n:1/2, pp:19-30 [Journal]
  6. Günter Schaar, A. Pawel Wojda
    An upper bound for the Hamiltonicity exponent of finite digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:313-316 [Journal]
  7. Günter Schaar
    On the Hamiltonicity exponent of directed cacti. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:275-284 [Journal]
  8. Günter Schaar
    On 'maximal' Hamiltonian cycles in the square of a block. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:121, n:1-3, pp:195-198 [Journal]

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