Discrete Mathematics, Volume 63

Volume 63, Number 1, January 1987

• G. F. Clements:
  An extremal problem for antichains of subsets of a multiset. 1-14
  Electronic Edition (link) BibTeX
• Karen L. Collins, Peter W. Shor, John R. Stembridge:
  A lower bound for 0, 1, * tournament codes. 15-19
  Electronic Edition (link) BibTeX
• Anthony B. Evans:
  Generating orthomorphisms of GF(q)⁺. 21-26
  Electronic Edition (link) BibTeX
• J. W. Moon:
  The number of trees with a 1-factor. 27-37
  Electronic Edition (link) BibTeX
• P. J. Owens:
  Knight's move squares. 39-51
  Electronic Edition (link) BibTeX
• Terunao Soneoka, Hiroshi Nakada, Makoto Imase, Claudine Peyrat:
  Sufficient conditions for maximally connected dense graphs. 53-66
  Electronic Edition (link) BibTeX
• P. R. Stein, C. J. Everett:
  On the iteration of a bijective transformation of integer k-tuples. 67-79
  Electronic Edition (link) BibTeX
• Peter R. Wild:
  Difference basis systems. 81-90
  Electronic Edition (link) BibTeX
• Huw Davies:
  Flag-transitivity and primitivity. 91-93
  Electronic Edition (link) BibTeX
• Charles H. Jepsen:
  On colorings of finite projective planes. 95-96
  Electronic Edition (link) BibTeX
• Peter Frankl, Hiroshi Maehara:
  Open-interval graphs versus closed-interval graphs. 97-100
  Electronic Edition (link) BibTeX
• Edward R. Scheinerman:
  Irredundancy in multiple interval representations. 101-108
  Electronic Edition (link) BibTeX
• James E. Simpson:
  A note on perfect systems of difference sets. 109-110
  Electronic Edition (link) BibTeX

Volume 63, Numbers 2-3, 1987

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