The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1991, volume: 91, number: 2

  1. H. L. Abbott, Meir Katchalski
    Further results on snakes in powers of complete graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:91, n:2, pp:111-120 [Journal]
  2. A. Clivio
    Tilings of a torus with rectangular boxes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:91, n:2, pp:121-139 [Journal]
  3. C. Cooper
    Pancyclic Hamilton cycles in random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:91, n:2, pp:141-148 [Journal]
  4. Peter C. Fishburn, J. C. Lagarias, James A. Reeds, Larry A. Shepp
    Sets uniquely determined by projections on axes II Discrete case. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:91, n:2, pp:149-159 [Journal]
  5. Peter McMullen
    Regular polyhedra related to projective linear groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:91, n:2, pp:161-170 [Journal]
  6. A. Quilliot
    Une condition pour qu'une famille de triangles soit orientable en un ordre cyclique. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:91, n:2, pp:171-182 [Journal]
  7. Christian Schindler
    Constructible hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:91, n:2, pp:183-191 [Journal]
  8. Stephen L. Snover, Charles Waiveris, John K. Williams
    Rep-tiling for triangles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:91, n:2, pp:193-200 [Journal]
  9. Yeow Meng Chee
    Graphical t-designs with block sizes three and four. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:91, n:2, pp:201-206 [Journal]
  10. Alon Nilli
    On the second eigenvalue of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:91, n:2, pp:207-210 [Journal]
  11. Talmage James Reid
    A note on roundedness in 4-connected matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:91, n:2, pp:211-214 [Journal]
  12. A. F. Sidorenko
    Triangle-free regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:91, n:2, pp:215-217 [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