The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1988, volume: 68, number: 1

  1. H. L. Abbott, Meir Katchalski
    Snakes and pseudo-snakes in powers of complete graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:68, n:1, pp:1-8 [Journal]
  2. Zhibo Chen, Fuji Zhang
    Bounds of the longest directed cycle length for minimal strong digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:68, n:1, pp:9-13 [Journal]
  3. John Greene
    Bijections related to statistics on words. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:68, n:1, pp:15-29 [Journal]
  4. J. N. Hooker
    Networklike metric spaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:68, n:1, pp:31-43 [Journal]
  5. Christos Koukouvinos, Stratis Kounias
    Hadamard matrices of the Williamson type of order 4·m, m=p·q an exhaustive search for m=33. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:68, n:1, pp:45-57 [Journal]
  6. Stratis Kounias, Nicos Farmakis
    On the excess of Hadamard matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:68, n:1, pp:59-69 [Journal]
  7. Germain Kreweras, Paul Moszkowski
    Signatures des permutations et des mots extraits. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:68, n:1, pp:71-76 [Journal]
  8. Bruce M. Landman, Raymond N. Greenwell
    Values and bounds for Ramsey numbers associated with polynomial iteration. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:68, n:1, pp:77-83 [Journal]
  9. Manoel Lemos
    An extension of Lindström's result about characteristic sets of matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:68, n:1, pp:85-101 [Journal]
  10. Anne Delandtsheer
    Line-primitive groups of small rank. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:68, n:1, pp:103-106 [Journal]
  11. Mario Gionfriddo, Salvatore Milici
    On the parameter v2(h)<=6h for L2-coloured graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:68, n:1, pp:107-110 [Journal]
  12. Alain Hertz, Dominique de Werra
    Perfectly orderable graphs are quasi-parity graphs: a short proof. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:68, n:1, pp:111-113 [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