The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1986, volume: 61, number: 2-3

  1. A. M. Assaf
    On the covering of pairs by quadruples. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:119-132 [Journal]
  2. Gerhard Behrendt
    Shaprly transitive partially ordered sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:133-139 [Journal]
  3. J. Chvatalova, Jaroslav Opatrny
    The bandwidth problem and operations on graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:141-150 [Journal]
  4. W. Edwin Clark
    Cyclic codes over GF(q) with simple orbit structure. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:151-164 [Journal]
  5. Peter C. Fishburn, Frank K. Hwang, Hikyu Lee
    Do local majorities force a global majority? [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:165-179 [Journal]
  6. Harold Fredricksen, Irving J. Kessler
    An algorithm for generating necklaces of beads in two colors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:181-188 [Journal]
  7. M. K. Gill, G. A. Patwardhan
    Switching invariant two-path signed graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:189-196 [Journal]
  8. John L. Goldwasser
    Permanent of the laplacian matrix of trees with a given matching. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:197-212 [Journal]
  9. Wan Honghui, Li Qiao
    On the number of tournaments with prescribed score vector. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:213-219 [Journal]
  10. Masahide Kuwada, Shinji Kuriki
    Some existence conditions for partially balanced arrays with 2 symbols. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:221-233 [Journal]
  11. Hiroshi Maehara
    Metric transforms of finite spaces and connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:235-246 [Journal]
  12. Frédéric Maffray
    On kernels in i-triangulated graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:247-251 [Journal]
  13. Zbigniew Palka, Andrzej Rucinski, Joel Spencer
    On a method for random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:253-258 [Journal]
  14. M. Preissmann, Dominique de Werra, Nadimpalli V. R. Mahadev
    A note on superbrittle graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:259-267 [Journal]
  15. Rolf S. Rees
    Minimal clique partitions and pairwise balanced designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:269-280 [Journal]
  16. Martin Skoviera
    A contribution to the theory of voltage graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:281-292 [Journal]
  17. Peter J. Slater
    On k-graceful, countably infinite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:293-303 [Journal]
  18. Douglas R. Stinson
    Concerning the spectrum of perpendicular arrays of triple systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:305-310 [Journal]
  19. Paul Terwilliger
    A new feasibility condition for distance-regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:311-315 [Journal]
  20. Anne Delandtsheer
    Orbits in uniform hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:317-319 [Journal]
  21. Hans-Dietrich O. F. Gronau, Roger Labahn
    An extremal coloring problem on matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:321-324 [Journal]
  22. Arie Bialostocki
    An application of the Ramsey theorem to ordered r-tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:325-328 [Journal]
  23. W. Bienia, Henry Meyniel
    Partitions of digraphs into paths or circuits. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:329-331 [Journal]
  24. Peter Gerl
    Natural spanning trees of Zd are recurrent. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:333-336 [Journal]
  25. K. V. Menon
    Note on some determinants of q-binomial numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:337-341 [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