The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

V. Faber: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jean-Claude Bermond, V. Faber
    Decomposition of the complete directed graph into k-circuits. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1976, v:21, n:2, pp:146-155 [Journal]
  2. Richard N. Draper, V. Faber
    The Diameter and Average Distance of Supertoroidal Networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1995, v:31, n:1, pp:1-13 [Journal]
  3. Fan R. K. Chung, V. Faber, Thomas A. Manteuffel
    An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:3, pp:443-457 [Journal]
  4. Andrzej Ehrenfeucht, V. Faber, Hal A. Kierstead
    A new method of proving theorems on chromatic index. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:52, n:2-3, pp:159-164 [Journal]

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