The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1986, volume: 62, number: 3

  1. Richard P. Anstee, Zoltán Füredi
    Forbidden submatrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:3, pp:225-243 [Journal]
  2. Hans-Jürgen Bandelt, Henry Martyn Mulder
    Pseudo-modular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:3, pp:245-260 [Journal]
  3. Dominique Bénard, André Bouchet, Jean-Luc Fouquet
    (m)-covering of a triangulation. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:3, pp:261-270 [Journal]
  4. Béla Bollobás, Chie Nara, Shun-ichi Tachibana
    The maximal number of induced complete bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:3, pp:271-275 [Journal]
  5. Olof Heden
    Maximal partial spreads and two-weight codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:3, pp:277-293 [Journal]
  6. David Klarner
    The number of tiered posets modulo six. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:3, pp:295-297 [Journal]
  7. Seiya Negami
    Enumeration of projective-planar embeddings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:3, pp:299-306 [Journal]
  8. Peter J. Cameron
    Regular orbits of permutation groups on the power set. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:3, pp:307-309 [Journal]
  9. P. Frankl
    What must be contained in every oriented k-uniform hypergraph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:3, pp:311-313 [Journal]
  10. Bernd Sturmfels
    Central and parallel projections of polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:3, pp:315-318 [Journal]
  11. Hiroshi Umeo, Isao Nakatsuka
    A pipeline-interval-optimum systolic queue. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:3, pp:319-323 [Journal]
  12. Gerald L. Alexanderson, John E. Wetzel
    On d-arrangements associated with a simplex. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:3, pp:325-328 [Journal]
  13. András Gyárfás
    Corrigendum. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:3, pp: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