The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1990, volume: 82, number: 3

  1. Izak Broere, Marietjie Frick
    On the order of uniquely (k, m)-colourable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:3, pp:225-232 [Journal]
  2. Jurek Czyzowicz, Andrzej Pelc, Ivan Rival
    Drawing orders with few slopes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:3, pp:233-250 [Journal]
  3. David C. Fisher, Anita E. Solow
    Dependence polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:3, pp:251-258 [Journal]
  4. Mark D. Halsey
    Extensions of line-closed combinatorial geometries. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:3, pp:259-262 [Journal]
  5. Hans Kurzweil
    A combinatorial technique for simplicial complexes and some applications to finite groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:3, pp:263-278 [Journal]
  6. Gaetano Quattrocchi
    On the intersection of two S(3, 4, 2upsilon) having a same derived triple system. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:3, pp:279-286 [Journal]
  7. Edward R. Scheinerman
    An evolution of interval graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:3, pp:287-302 [Journal]
  8. Lewis E. Varga
    Geometric matrices and an inequality for (0, 1)-matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:3, pp:303-315 [Journal]
  9. Frans C. Bussemaker, Vladimir D. Tonchev
    Extremal doubly-even codes of length 40 derived from Hadamard matrices of order 20. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:3, pp:317-321 [Journal]
  10. Yair Caro, Yehuda Roditty
    A note on packing trees into complete bipartite graphs and on fishburn's conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:3, pp:323-326 [Journal]
  11. Gena Hahn, Bill Jackson
    A note concerning paths and independence number in digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:3, pp:327-329 [Journal]
  12. Iwao Sato
    Enumeration of packed graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:3, pp:331-333 [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