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