default search action
Journal of Combinatorial Theory, Series A, Volume 51
Volume 51, Number 1, May 1989
- Souichi Okada:
On the generating functions for certain classes of plane partitions. 1-23 - Nicholas Pippenger, Joel H. Spencer:
Asymptotic behavior of the chromatic index for hypergraphs. 24-42 - Andrzej Pelc:
Detecting errors in searching games. 43-54 - William D. Weakley:
On the number of Cinfinity-words of each length. 55-62 - Helmut Koch:
On self-dual, doubly even codes of length 32. 63-76 - Amram Meir, John W. Moon:
On an asymptotic method in enumeration. 77-89 - Jerrold R. Griggs, James W. Walker:
Anticlusters and intersecting families of subsets. 90-103 - Oscar Moreno:
On the existence of a primitive quadratic of trace 1 over GF(pm). 104-110 - Svatopluk Poljak, Zsolt Tuza:
On the maximum number of qualitatively independent partitions. 111-116 - Solomon W. Golomb:
Polyominoes which tile rectangles. 117-124 - Karl A. Dahlke:
The Y-hexomino has order 92. 125-126 - Karl A. Dahlke:
A heptomino of order 76. 127-128 - Stephen D. Smith:
A geometric condition for incidence-matrix nuffvectors. 129-134 - Robert A. Proctor:
Equivalence of the combinatorial and the classical definitions of schur functions. 135-137 - David Gluck:
Hadamard difference sets in groups of order 64. 138-140 - Jiang Zeng:
Pfaff-saalschutz revisited. 141-143 - Moshe Koppel:
Unpredictable strings are collectives. 144-148
Volume 51, Number 2, July 1989
- Timothy A. Green:
Asymptotic enumeration of generalized latin rectangles. 149-160 - Klaus Metsch:
Embedding finite planar spaces into 3-dimensional projective spaces. 161-168 - Freeman J. Dyson:
Mappings and symmetries of partitions. 169-180 - Paul H. Edelman:
Tableaux and chains in a new partial order of Sn. 181-204 - Henning Stichtenoth:
Which extended goppa codes are cyclic? 205-220 - Sandra C. McLaurin, Douglas D. Smith:
Constructing transpose-orthogonal Latin squares. 221-226 - Stephen D. Cohen:
Generators in cyclic difference sets. 227-236 - Véronique Bruyère:
About prefix sets of words. 237-243 - Tom C. Brown, Allen R. Freedman:
Small sets which meet all the k(n)-term arithmetic progressions in the interval [1, n]. 244-249 - Ernest Shult:
Nonexistence of ovoids in Omega+(10, 3). 250-257 - A. Hedayat, J. Stufken, Ivan N. Landgev:
The possible support sizes for BIB designs with nu = 8 and k = 4. 258-267 - Alan R. Camina, Johannes Siemons:
Block transitive automorphism groups of 2-(nu, k, 1) block designs. 268-276 - Jay A. Wood:
Spinor groups and algebraic coding theory. 277-313 - Midori Kobayashi, Kiyasu-Zen'iti:
Perfect one-factorizations of K1332 and K6860. 314-315
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 2025-02-19 00:34 CET 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: