The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1981, volume: 35, number: 1-3

  1. Martin Aigner
    Producing posets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:35, n:1-3, pp:1-15 [Journal]
  2. Peter Burmeister
    On maximal objects in classes of (DI)graphs determined by prescribed factorobjects. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:35, n:1-3, pp:17-23 [Journal]
  3. Thomas H. Brylawski
    Hyperplane reconstruction of the Tutte polynomial of a geometric lattice. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:35, n:1-3, pp:25-38 [Journal]
  4. Dwight Duffus, Maurice Pouzet, Ivan Rival
    Complete ordered sets with no infinite antichains. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:35, n:1-3, pp:39-52 [Journal]
  5. Dwight Duffus, Ivan Rival
    A structure theory for ordered sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:35, n:1-3, pp:53-118 [Journal]
  6. Marcel Erné
    On the cardinalities of finite topologies and the number of antichains in partially ordered sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:35, n:1-3, pp:119-133 [Journal]
  7. David Kelly
    On the dimension of partially ordered sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:35, n:1-3, pp:135-156 [Journal]
  8. R. McKenzie, R. Quackenbush
    The spectrum of a lattice-primal algebra. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:35, n:1-3, pp:157-163 [Journal]
  9. E. C. Milner, N. Sauer
    Remarks on the cofinality of a partially ordered set, and a generalization of König's lemma. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:35, n:1-3, pp:165-171 [Journal]
  10. Bernard Monjardet
    Metrics on partially ordered sets - A survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:35, n:1-3, pp:173-184 [Journal]
  11. Hans Jürgen Prömel, Bernd Voigt
    Recent results in partition (Ramsey) theory for finite lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:35, n:1-3, pp:185-198 [Journal]
  12. Richard Rado
    Theorems on intervals of ordered sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:35, n:1-3, pp:199-201 [Journal]
  13. Ivan Rival, Rudolf Wille
    The smallest order variety containing all chains. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:35, n:1-3, pp:203-212 [Journal]
  14. Bill Sands
    Counting antichains in finite partially ordered sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:35, n:1-3, pp:213-228 [Journal]
  15. William T. Trotter
    Stacks and splits of partially ordered sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:35, n:1-3, pp:229-256 [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