The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1991, volume: 98, number: 3

  1. Chính T. Hoàng, Frédéric Maffray, Myriam Preissmann
    New properties of perfectly orderable graphs and strongly perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:98, n:3, pp:161-174 [Journal]
  2. M. Hofmeister
    Isomorphisms and automorphisms of graph coverings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:98, n:3, pp:175-183 [Journal]
  3. Jean-Pierre Roudneff
    Cells with many facets in arrangements of hyperplanes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:98, n:3, pp:185-191 [Journal]
  4. Rodica Simion, Daniel Ullman
    On the structure of the lattice of noncrossing partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:98, n:3, pp:193-206 [Journal]
  5. Miroslaw Truszczynski
    Decompositions of graphs into forests with bounded maximum degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:98, n:3, pp:207-222 [Journal]
  6. Mao-cheng Cai
    On some factor theorems of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:98, n:3, pp:223-229 [Journal]
  7. Tomasz Luczak
    Cycles in random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:98, n:3, pp:231-236 [Journal]
  8. Vojislav Petrovic, Carsten Thomassen
    Kings in k-partite tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:98, n:3, pp:237-238 [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