The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1990, volume: 81, number: 3

  1. C. R. J. Clapham
    Graphs self-complementary in Kn - e. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:81, n:3, pp:229-235 [Journal]
  2. Wilfried Imrich, Gert Sabidussi
    Focality and graph isomorphism. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:81, n:3, pp:237-245 [Journal]
  3. R. Kemp
    On the number of deepest nodes in ordered trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:81, n:3, pp:247-258 [Journal]
  4. Louis Worthy Kolitsch
    A simple proof of some congruences for colored generalized frobenius partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:81, n:3, pp:259-261 [Journal]
  5. Rolf S. Rees
    The existence of restricted resolvable designs II: (1, 2)-factorizations of K2n+1. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:81, n:3, pp:263-301 [Journal]
  6. Dorothea Wagner
    Decomposition of k-ary relations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:81, n:3, pp:303-322 [Journal]
  7. Tom Blyth, Jules Varlet
    Principal congruences on some lattice- ordered algebras. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:81, n:3, pp:323-329 [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