Journals in DBLP

Discrete Mathematics
1987, volume: 63, number: 2-3

1. Martin Aigner, Rudolf Wille
   Preface. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:63, n:2-3, pp:115- [Journal]
   
2. E. Rodney Canfield, Nicholas C. Wormald
   Ménage numbers, bijections and P-recursiveness. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:63, n:2-3, pp:117-129 [Journal]
   
3. Ulrich Faigle, György Turán
   On the complexity of interval orders and semiorders. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:63, n:2-3, pp:131-141 [Journal]
   
4. Zoltán Füredi, Jerrold R. Griggs, Andrew M. Odlyzko, James B. Shearer
   Ramsey-Sperner theory. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:63, n:2-3, pp:143-152 [Journal]
   
5. Bernhard Ganter, Gerhart Häfner, Werner Poguntke
   On linear extensions of ordered sets with a symmetry. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:63, n:2-3, pp:153-156 [Journal]
   
6. Michel Habib, Rolf H. Möhring
   On some complexity properties of N-free posets and posets with bounded decomposition diameter. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:63, n:2-3, pp:157-182 [Journal]
   
7. Jeff Kahn, Michael E. Saks
   On the widths of finite distributive lattices. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:63, n:2-3, pp:183-195 [Journal]
   
8. David Kelly
   Fundamentals of planar ordered sets. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:63, n:2-3, pp:197-216 [Journal]
   
9. Hal A. Kierstead, William T. Trotter
   A Ramsey theoretic problem for finite ordered sets. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:63, n:2-3, pp:217-223 [Journal]
   
10. Jimmie D. Lawson, Michael W. Mislove, Hilary A. Priestley
    Ordered sets with no infinite antichains. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:63, n:2-3, pp:225-230 [Journal]
    
11. Richard J. Nowakowski
    Cutsets of Boolean lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:63, n:2-3, pp:231-240 [Journal]
    
12. Oliver Pretzel
    A non-covering graph of girth six. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:63, n:2-3, pp:241-244 [Journal]
    
13. Klaus Reuter
    Matchings for linearly indecomposable modular lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:63, n:2-3, pp:245-247 [Journal]
    
14. Ivan Rival, Nejib Zaguia
    Greedy linear extensions with constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:63, n:2-3, pp:249-260 [Journal]
    
15. Ivo G. Rosenberg
    Characterization of diagrams by 0-1 inequalities. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:63, n:2-3, pp:261-270 [Journal]
    
16. Jichang Sha, Daniel J. Kleitman
    The number of linear extensions of subset ordering. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:63, n:2-3, pp:271-278 [Journal]
    
17. Maciej M. Syslo
    Minimizing the jump number for partially-ordered sets: a graph-theoretic approach, II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:63, n:2-3, pp:279-295 [Journal]
    
18. Douglas B. West
    Unichain coverings in partial orders with the nested saturation property. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:63, n:2-3, pp:297-303 [Journal]
    
19. Rudolf Wille
    Subdirect product construction of concept lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:63, n:2-3, pp:305-313 [Journal]