default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series A, Volume 21
Volume 21, Number 1, July 1976
- Gadi Moran:
Reflection Classes Whose Cubes Cover the Alternating Group. 1-19 - Charlotte Huang:
Balanced Bipartite Weighing Designs. 20-34 - Charles C. Lindner, Alexander Rosa:
Steiner Quadruple Systems All of Whose Derived Steiner Triple Systems Are Nonisomorphic. 35-43 - Frank K. Hwang:
New Constructions for Balanced Howell Rotations. 44-51 - Shuo-Yen Robert Li:
Sums of Zuchswang Games. 52-67 - Rolf Burkhardt:
Über ein kombinatorisches Problem aus der modularen Darstellungstheorie. 68-79 - Tom C. Brown:
Common Transversals. 80-85 - Frank K. Hwang:
New Classes of Complete Balanced Howell Rotations. 86-92 - Michel Dehon:
Un théorème d'extension de t-designs. 93-99 - Hansraj Gupta:
Combinatorial Proof of a Theorem on Partitions into an Even or Odd Number of Parts. 100-103 - Charles C. Lindner:
A Finite Partial Idempotent Latin Cube Can Be Embedded in a Finite Idempotent Latin Cube. 104-109 - Saharon Shelah
:
Decomposing Uncountable Squares to Countably Many Chains. 110-114 - Joseph A. Thas:
A Restriction on the Parameters of a Subhexagon. 115-117 - H. Paul Williams:
Fourier-Motzkin Elimination Extension to Integer Programming Problems. 118-123 - Bernd Kind, Peter Kleinschmidt:
On the Maximal Volume of Convex Bodies with Few Vertices. 124-128
Volume 21, Number 2, September 1976
- Daniel J. Kleitman, David Joseph Kwiatkowski:
A Lower Bound on the Length of a Sequence Containing All Permutations as Subsequences. 129-136 - Alan D. Taylor:
A Canonical Partition Relation for Finite Subsets of omega. 137-146 - Joel V. Brawley:
The Number of Polynomial Functions which Permute the Matrices over a Finite Field. 147-154 - Robert Donaghey:
Binomial Self-Inverse Sequences and Tangent Coefficients. 155-163 - Jan Søreng:
The Periods of the Sequences Generated by Some Symmetric Shift Registers. 164-187 - Jennifer Seberry Wallis:
On the Existence of Hadamard Matrices. 188-195 - Stephen M. Tanny:
Permutations and Successions. 196-202 - Peter J. Cameron:
Embedding Edge-Colored Complete Graphs in Binary Affine Spaces. 203-215 - A. P. Hillman, R. M. Grassl:
Reverse Plane Partitions and Tableau Hook Numbers. 216-221 - Hans S. Witsenhausen:
On Woodall's Interval Problem. 222-229 - Jay R. Goldman, James T. Joichi, Dennis E. White:
Rook Theory. V - Rook Polynomials, Möbius Inversion and the Umbral Calculus. 230-239 - Albert Nijenhuis:
On Permanents and the Zeros of Rook Polynomials. 240-244 - G. F. Clements:
The Kruskal-Katona Method Made Explicit. 245-249 - Glenn F. Stahly:
A Construction for PBIBD(2)'s. 250-252 - Harold N. Ward:
A Restriction on the Weight Enumerator of a Self-Dual Code. 253-255
Volume 21, Number 3, November 1976
- M. R. Garey, Ronald L. Graham, David S. Johnson, Andrew Chi-Chih Yao:
Resource Constrained Scheduling as Generalized Bin Packing. 257-298 - P. J. Owens:
Solutions to Two Problems of Dénes and Keedwell on Row-Complete Latin Squares. 299-308 - Ivan Rival:
A Fixed Point Theorem for Finite Partially Ordered Sets. 309-318 - Kenneth P. Bogart, Issie Rabinovich, William T. Trotter:
A Bound on the Dimension of Interval Orders. 319-328 - A. E. Hurd:
Synergy of Homomorphisms in Relational Systems. 329-335 - C. W. Norman:
Nonisomorphic Hadamard Designs. 336-344 - Branko Grünbaum, Geoffrey C. Shephard:
Incidence Numbers of Complexes and Polytopes. 345-368 - Zahava Shmuely:
Increasing and Decreasing Operators on Complete Lattices. 369-383 - Christoph Bandt:
Permutation Designs. 384-392
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 2024-12-22 19:00 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:
