default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 63
Volume 63, Number 1, January 1987
- G. F. Clements:
An extremal problem for antichains of subsets of a multiset. 1-14 - Karen L. Collins, Peter W. Shor, John R. Stembridge:
A lower bound for 0, 1, * tournament codes. 15-19 - Anthony B. Evans:
Generating orthomorphisms of GF(q)+. 21-26 - John W. Moon:
The number of trees with a 1-factor. 27-37 - P. J. Owens:
Knight's move squares. 39-51 - Terunao Soneoka, Hiroshi Nakada, Makoto Imase, Claudine Peyrat:
Sufficient conditions for maximally connected dense graphs. 53-66 - P. R. Stein, C. J. Everett:
On the iteration of a bijective transformation of integer k-tuples. 67-79 - Peter R. Wild:
Difference basis systems. 81-90 - Huw Davies:
Flag-transitivity and primitivity. 91-93 - Charles H. Jepsen:
On colorings of finite projective planes. 95-96 - Peter Frankl, Hiroshi Maehara:
Open-interval graphs versus closed-interval graphs. 97-100 - Edward R. Scheinerman:
Irredundancy in multiple interval representations. 101-108 - James E. Simpson:
A note on perfect systems of difference sets. 109-110
Volume 63, Numbers 2-3, 1987
- Martin Aigner, Rudolf Wille:
Preface. Discret. Math. 63(2-3): 115 (1987) - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-06-15 01:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
