Handbook of Combinatorial Designs, First Edition
Table of Contents
Part I: Balanced Incomplete Block Designs and t-Designs (pp. 3 - 96)
- 2-(v, k, \lambda ) Designs of Small Order (Rudolf Mathon, Alexander Rosa):
- BIBDs with Small Block Size (R. Julian R. Abel, Malcolm Greig):
- t-Designs, t \geq 3 (Donald L. Kreher):
- Steiner Systems (Charles J. Colbourn, Rudolf Mathon):
- Symmetric Designs (Tran van Trung):
- Resolvable and Near Resolvable Designs (R. Julian R. Abel, Steven C. Furino):
Part II: Latin Squares, MOLS, and Orthogonal Arrays (pp. 97 - 184)
- Latin Squares (Charles J. Colbourn, Jeffrey H. Dinitz):
- Mutually Orthogonal Latin Squares (MOLS) (R. Julian R. Abel, Andries E. Brouwer, Charles J. Colbourn, Jeffrey H. Dinitz):
- Incomplete MOLS (R. Julian R. Abel, Charles J. Colbourn, Jeffrey H. Dinitz):
- Orthogonal Arrays of Index More Than One (Charles J. Colbourn):
- Orthogonal Arrays of Strength More Than Two (J\"urgen Bierbrauer, Charles J. Colbourn):
Part III: Pairwise Balanced Designs (pp. 185 - 228)
- PBDs and GDDs: The Basics (Ronald C. Mullin, Hans-Dietrich O.F. Gronau):
- PBDs: Recursive Constructions (Ronald C. Mullin, Hans-Dietrich O.F. Gronau):
- PBD-Closure (Frank E. Bennett, Hans-Dietrich O.F. Gronau, Alan C.H. Ling, Ronald C. Mullin):
- Pairwise Balanced Designs as Linear Spaces (Hans-Dietrich O.F. Gronau, Ronald C. Mullin, Christian Pietsch):
- PBDs and GDDs of Higher Index (Ronald C. Mullin, Hans-Dietrich O.F. Gronau):
- PBDs, Frames, and Resolvability (Ronald C. Mullin, Hans-Dietrich O.F. Gronau):
Part IV: Other Combinatorial Designs (pp. 229 - 516)
- Association Schemes (Christopher D. Godsil):
- Balanced (Part) Ternary Designs (Thomas Kunkle, Dinesh G. Sarvate):
- Balanced Tournament Designs (Esther R. Lamken):
- Bhaskar Rao Designs (Warwick de Launey):
- Complete Mappings and Sequencings of Finite Groups (Donald Keedwell):
- Configurations (Harald Gropp):
- Costas Arrays (Herbert Taylor):
- Coverings (Douglas R. Stinson):
- Cycle Systems (C.A. Rodger):
- Difference Families (R. Julian R. Abel):
- Difference Matrices (Charles J. Colbourn, Warwick de Launey):
- Difference Sets: Abelian (Dieter Jungnickel, Alexander Pott):
- Difference Sets: Nonabelian (Ken W. Smith):
- Difference Triangle Sets (Charles J. Colbourn):
- Directed Designs (Frank E. Bennett, Alireza Mahmoodi):
- D-Optimal Matrices (Hadi Kharaghani):
- Embedding Partial Quasigroups (C.C. Lindner):
- Equidistant Permutation Arrays (Alireza Mahmoodi, Paul J. Schellenberg):
- Factorial Designs (Deborah J. Street):
- Frequency Squares (Charles F. Laywine):
- Generalized Quadrangles (Stanley E. Payne):
- Graph Decompositions and Designs (Katherine Heinrich):
- Graphical Designs (Yeow Meng Chee):
- Hadamard Matrices and Designs (R. Craigen):
- Hall Triple Systems (Lucien Beneteau):
- Howell Designs (Jeffrey H. Dinitz):
- Maximal Sets of MOLS (Anthony B. Evans):
- Mendelsohn Designs (Eric Mendelsohn):
- The Oberwolfach Problem (Brian Alspach):
- Ordered Designs and Perpendicular Arrays (J\"urgen Bierbrauer):
- Orthogonal Designs (Jennifer Seberry, R. Craigen):
- Orthogonal Main Effect Plans (Deborah J. Street):
- Packings (Douglas R. Stinson):
- Partial Geometries (Joseph A. Thas):
- Partially Balanced Incomplete Block Designs (Deborah J. Street, Anne Penfold Street):
- Quasigroups (Frank E. Bennett):
- Quasi-Symmetric Designs (Mohan S. Shrikhande):
- (r, \lambda )-designs (G.H. John van Rees):
- Room Squares (Jeffrey H. Dinitz):
- Self-Orthogonal Latin Squares (SOLS) (L. Zhu):
- SOLS with a Symmetric Orthogonal Mate (SOLSSOM) (Norman J. Finizio):
- Sequences with Zero Autocorrelation (Christos Koukouvinos):
- Skolem Sequences (Nabil Shalaby):
- Spherical t-Designs (Stuart G. Hoggar):
- Starters (Jeffrey H. Dinitz):
- Trades and Defining Sets (Anne Penfold Street):
- (t,m,s)-Nets (Charles J. Colbourn):
- Tuscan Squares (Hong-Yeop Song, Jeffrey H. Dinitz):
- t-Wise Balanced Designs (Earl S. Kramer):
- Uniformly Resolvable Designs (Peter Danziger, Peter Rodney):
- Vector Space Designs (Dijen K. Ray-Chaudhuri):
- Weighing Matrices and Conference Matrices (R. Craigen):
- Whist Tournaments (Ian Anderson):
- Youden Designs, Generalized (Charles J. Colbourn):
- Youden Squares (Donald A. Preece):
Part V: Applications (pp. 517 - 586)
- Codes (Vladimir D. Tonchev):
- Computer Science: Selected Applications (Charles J. Colbourn):
- Applications of Designs to Cryptography (K. Gopalakrishnan, Douglas R. Stinson):
- Derandomization (K. Gopalakrishnan, Douglas R. Stinson):
- Optimality and Efficiency: Comparing Block Designs (Deborah J. Street):
- Group Testing (Charles J. Colbourn):
- Scheduling a Tournament (Jeffrey H. Dinitz, Esther R. Lamken, Walter D. Wallis ):
- Winning the Lottery (Charles J. Colbourn):
Part VI: Related Mathematics and Computational Methods (pp. 587 - 740)
- Finite Groups and Designs (Leo G. Chouinard II, Robert Jajcay, Spyros S. Magliveras):
- Number Theory and Finite Fields (Hugh Williams):
- Graphs and Multigraphs (Gordon F. Royle):
- Factorizations of Graphs (Lars D. Andersen):
- Strongly Regular Graphs (Andries E. Brouwer):
- Two-Graphs (Edward Spence):
- Classical Geometries (Albrecht Beutelspacher):
- Projective Planes, Nondesarguesian (Marialuisa J. de Resmini):
- Computational Methods in Design Theory (Peter B. Gibbons):
Index (pp. 741 - 753)
Return to the
HCD home page.