The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1991, volume: 94, number: 3

  1. Hans-Jürgen Bandelt, Henry Martyn Mulder
    Pseudo-median graphs: decomposition via amalgamation and Cartesian multiplication. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:94, n:3, pp:161-180 [Journal]
  2. Hortensia Galeana-Sánchez, Victor Neumann-Lara
    Extending kernel perfect digraphs to kernel perfect critical digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:94, n:3, pp:181-187 [Journal]
  3. Xueliang Li, Fuji Zhang
    On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:94, n:3, pp:189-197 [Journal]
  4. Xiaoyun Lu
    A matching game. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:94, n:3, pp:199-207 [Journal]
  5. Bennet Manvel, Aaron Meyerowitz, A. Schwenk, K. Smith, Paul K. Stockmeyer
    Reconstruction of sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:94, n:3, pp:209-219 [Journal]
  6. Arie Bialostocki, P. Dierker
    An isoperimetric lemma. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:94, n:3, pp:221-228 [Journal]
  7. Iiro S. Honkala
    All binary codes with covering radius one are subnormal. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:94, n:3, pp:229-232 [Journal]
  8. Jozef Sirán
    Duke's theorem does not extend to signed graph embeddings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:94, n:3, pp:233-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