The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1991, volume: 96, number: 3

  1. Richard A. Brualdi, Bryan L. Shader
    Matrices of 0's and 1's with restricted permanental minors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:96, n:3, pp:161-174 [Journal]
  2. Sheshayya A. Choudum
    On forcibly connected graphic sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:96, n:3, pp:175-181 [Journal]
  3. Roberto Cignoli
    Quantifiers on distributive lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:96, n:3, pp:183-197 [Journal]
  4. Pierre Hansen, Julio Kuplinsky
    The smallest hard-to-color graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:96, n:3, pp:199-212 [Journal]
  5. Antoni Marczyk, Zdzislaw Skupien
    Maximum nonhamiltonian tough graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:96, n:3, pp:213-220 [Journal]
  6. Harald Niederreiter
    A combinatorial problem for vector spaces over finite fields. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:96, n:3, pp:221-228 [Journal]
  7. Jerzy Topp, Lutz Volkmann
    On packing and covering numbers of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:96, n:3, pp:229-238 [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