The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1983, volume: 43, number: 1

  1. Rudolf Berghammer, Gunther Schmidt
    Discrete ordering relations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:1, pp:1-7 [Journal]
  2. Prabir Das, S. B. Rao
    Alternating eulerian trails with prescribed degrees in two edge-colored complete graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:1, pp:9-20 [Journal]
  3. Pierre Duchet, Henry Meyniel
    Une generalisation du theoreme de Richardson sur l'existence de noyaux dans les graphes orientes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:1, pp:21-27 [Journal]
  4. J.-C. Fournier
    Hypergraphes de chaines d'aretes d'un arbre. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:1, pp:29-36 [Journal]
  5. Martin Charles Golumbic, Doron Rotem, Jorge Urrutia
    Comparability graphs and intersection graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:1, pp:37-46 [Journal]
  6. R. H. Jeurissen
    Disconnected graphs with magic labelings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:1, pp:47-53 [Journal]
  7. János Komlós, Endre Szemerédi
    Limit distribution for the existence of hamiltonian cycles in a random graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:1, pp:55-63 [Journal]
  8. Clement W. H. Lam
    Non-skew symmetric orthogonal matrices with constant diagonals. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:1, pp:65-78 [Journal]
  9. Josef Lauri
    Proof of Harary's conjecture on the reconstruction of trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:1, pp:79-90 [Journal]
  10. Dragan Marusic, T. D. Parsons
    Hamiltonian paths in vertex-symmetric graphs of order 4p. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:1, pp:91-96 [Journal]
  11. Peter Stein
    On Chvátal's conjecture related to a hereditary system. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:1, pp:97-105 [Journal]
  12. Pavel M. Blecher
    On a logical problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:1, pp:107-110 [Journal]
  13. Helmut Prodinger
    Non-repetitive sequences and gray code. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:1, pp:113-116 [Journal]
  14. Frank Ruskey
    A simple proof of a formula of Dershowitz and Zaks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:1, pp:117-118 [Journal]
  15. P. K. Wong
    On the smallest graphs of girth 10 and valency 3. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:1, pp:119-124 [Journal]
  16. David L. Reiner
    A q-analog of the campbell-baker-hausdorff formula. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:1, pp:125-129 [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