The SCEAS System
Navigation Menu

Journals in DBLP

J. Comb. Theory, Ser. B
1984, volume: 37, number: 2

  1. Trevor I. Fenner, Alan M. Frieze
    Hamiltonian cycles in random regular graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:2, pp:103-112 [Journal]
  2. Shlomo Moran
    On the length of optimal TSP circuits in sets of bounded diameter. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:2, pp:113-141 [Journal]
  3. S. Stueckle, Richard D. Ringeisen
    Generalized petersen graphs which are cycle permutation graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:2, pp:142-150 [Journal]
  4. Haruko Okamura
    Paths and edge-connectivity in graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:2, pp:151-172 [Journal]
  5. Aeryung Moon
    The graphs G(n, k) of the Johnson Schemes are unique for n geq 20. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:2, pp:173-188 [Journal]
  6. James G. Oxley
    On singleton 1-rounded sets of matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:2, pp:189-197 [Journal]
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