Volume 97, Numbers 1-3, December 1991
- Charles J. Colbourn, Dieter Jungnickel, Alexander Rosa:
Preface.
1
- Hanfried Lenz, Gerhard Ringel:
A brief review on Egmont Köhler's mathematical work.
3-16
- Brian Alspach, Donovan R. Hare:
Edge-pancyclic block-intersection graphs.
17-24
- K. T. Arasu, Dieter Jungnickel, Alexander Pott:
Symmetric divisible designs with k-lambda1 = 1.
25-38
- K. T. Arasu, Alexander Pott:
Some construction of group divisible designs with singer groups.
39-45
- Frank E. Bennett, Hao Shen:
On indecomposable pure Mendelsohn triple systems.
47-57
- Albrecht Beutelspacher:
A combinatorial characterization of geometric spreads.
59-62
- Aart Blokhuis, Andries E. Brouwer, Henny A. Wilbrink:
Hermitian unitals are code words.
63-68
- Lou Caccetta, K. Vijayan:
Long cycles in subgraphs with prescribed minimum degree.
69-81
- Peter J. Cameron:
Covers of graphs and EGQs.
83-92
- Yeow Meng Chee, Gordon F. Royle:
The 2-rotational Steiner triple systems of order 25.
93-100
- Amanda G. Chetwynd, Anthony J. W. Hilton:
Outline symmetric latin squares.
101-117
- Charles J. Colbourn, Alan Hartman:
Intersections and supports of quadruple systems.
119-137
- Charles J. Colbourn, Dean G. Hoffman, C. A. Rodger:
Directed star decompositions of directed multigraphs.
139-148
- Marialuisa J. de Resmini:
Some naive constructions of S(2, 3, v) and S(2, 4, v).
149-153
- Cornelis de Vroedt:
On the maximum cardinality of binary constant weight codes with prescribed distance.
155-160
- Cornelis de Vroedt:
Über einen Satz von Köhler.
161-165
- Ryoh Fuji-Hara, Shinya Kuriki:
Mutually balanced nested designs.
167-176
- Steven Furino:
Difference families from rings.
177-190
- Mario Gionfriddo, Filippo Milazzo, Vincenzo Vacirca:
Transitive multipermutation graphs: Case 4 <= n <= m.
191-198
- Mike J. Grannell, Terry S. Griggs, J. S. Phelan:
On infinite Steiner systems.
199-202
- Rudolf Halin:
Tree-partitions of infinite graphs.
203-217
- Heiko Harborth:
Plane four-regular graphs with vertex-to-vertex unit triangles.
219-222
- Katherine Heinrich:
Simple direct constructions for hybrid triple designs.
223-227
- James W. P. Hirschfeld, Tamás Szönyi:
Sets in a finite plane with few intersection numbers and a distinguished point.
229-242
- Dean G. Hoffman, Paul J. Schellenberg:
The existence of Ck-factorizations of K2n-F.
243-250
- Joseph Douglas Horton, Gillian M. Nonay:
Self-orthogonal Hamilton path decompositions.
251-264
- Zvonimir Janko, Vladimir D. Tonchev:
Cyclic 2-(91, 6, 1) designs with multiplier automorphisms.
265-268
- Dieter Jungnickel, Ronald C. Mullin, Scott A. Vanstone:
The spectrum of alpha-resolvable block designs with block size 3.
269-277
- Esther R. Lamken:
On near generalized balanced tournament designs.
279-294
- Maria Corinna Marino, Rolf S. Rees:
On parallelism in Steiner systems.
295-300
- Eric Mendelsohn, Nabil Shalaby:
Skolem labelled graphs.
301-317
- Oliver Pfaff:
On the simplicity of ·2 and ·3.
319-331
- Kevin T. Phelps:
A class of 2-chromatic SQS(22).
333-338
- W. L. Piotrowski:
The solution of the bipartite analogue of the Oberwolfach problem.
339-356
- Rolf S. Rees, Walter D. Wallis:
The spectrum of maximal sets of one-factors.
357-369
- Ralph-Hardo Schulz:
A note on check character systems using Latin squares.
371-375
- Helmut Siemon:
On the existence of cyclic Steiner Quadruple systems SQS (2p).
377-385
- Douglas R. Stinson:
Designs constructed from maximal arcs.
387-393
- M. Voigt, H. Walther:
On the chromatic number of special distance graphs.
395-397
- H. Zeitler:
About special classes of Steiner systems S(2, 4, upsilon).
399-407
- Lie Zhu, Beiliang Du, Xuebin Zhang:
A few more RBIBDs with k = 5 and lambda = 1.
409-417
Last update Sat May 18 20:21:34 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
