The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1981, volume: 34, number: 3

  1. Jin Akiyama, Hiroshi Era, Geoffrey Exoo
    Further results on graph equations for line graphs and n-th power graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:3, pp:209-218 [Journal]
  2. Gerald L. Alexanderson, John E. Wetzel
    Arrangements of planes in space. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:3, pp:219-240 [Journal]
  3. Andries E. Brouwer, Robert Tijdeman
    On the edge-colouring problem for unions of complete uniform hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:3, pp:241-260 [Journal]
  4. D. J. Hartfiel, Carlton J. Maxson
    The construction and decomposition of patterns induced by a positive cone of functions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:3, pp:261-274 [Journal]
  5. E. Marques De Sá
    Note on graphs and weakly cyclic matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:3, pp:275-281 [Journal]
  6. Denis Naddef, William R. Pulleyblank
    Matchings in regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:3, pp:283-291 [Journal]
  7. Nicolae Tandareanu
    On generalized Boolean functions i. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:3, pp:293-299 [Journal]
  8. Barbara Turner, Ken Warner
    The structure and geometry of 4×4 pandiagonal matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:3, pp:301-310 [Journal]
  9. Peter Frankl, Zoltán Füredi
    A short proof for a theorem of Harper about Hamming-spheres. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:3, pp:311-313 [Journal]
  10. T. A. McKee
    A quantifier for matroid duality. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:3, pp:315-318 [Journal]
  11. Heinrich Müller
    Oriented hypergraphs, stability numbers and chromatic numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:3, pp:319-320 [Journal]
  12. Jean-Pierre Barthélemy
    About the shortest chain between two vertices in a quasi strongly connected digraph with a potential. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:3, pp:321-324 [Journal]
  13. M. Boshernitzan, Aviezri S. Fraenkel
    Nonhomogeneous spectra of numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:3, pp:325-327 [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