Volume 120, Numbers 1-3, September 1993
- Shreeram S. Abhyankar:
Wreath products and enlargements of groups.
1-12

- Ron Aharoni, Irith Ben-Arroyo Hartman:
On Greene-Kleitman's theorem for general digraphs.
13-24

- Neal Brand, Somporn Sutinuntopas:
One-factors and the existence of affine designs.
25-35

- J. W. Breckenridge, K. Varadarajan, K. H. Wehrhahn:
Chains, multichains and Möbius numbers.
37-50

- Anka Golemac:
Construction of new symmetric designs with parameters (70, 24, 8).
51-58

- Bradley S. Gubser:
Planar graphs with no 6-wheel minor.
59-73

- Olof Heden:
Maximal partial spreads and the modular n-queen problem.
75-91

- Michael A. Henning, Henda C. Swart:
Bounds relating generalized domination parameters.
93-105

- Alexander V. Ivashchenko:
The coordinate representation of a graph and n-universal graph of radius 1.
107-114

- Hadi Kharaghani:
A construction for Hadamard matrices.
115-120

- Yaakov S. Kupitz:
On the existence of a combinatorial Schlegel diagram of a simplical unstacked 3-polytope with a prescribed set of vertices.
121-134

- Esther R. Lamken, Scott A. Vanstone:
Existence results for doubly near resolvable (upsilon, 3, 2)-BIBDs.
135-148

- Helmut Prodinger:
How to select a loser.
149-159

- László Pyber, Zsolt Tuza:
Menger-type theorems with restrictions on path lengths.
161-174

- Richard P. Stanley:
A combinatorial decomposition of acyclic simplicial complexes.
175-182

- Jianji Su:
On locally k-critically n-connected graphs.
183-190

- W. D. Wallis, Guo-Hui Zhang:
On the partition and coloring of a graph by cliques.
191-203

- C. Kenneth Fan:
Matchings and the sum function.
205-209

- Frédéric Maire:
A characterization of intersection graphs of the maximal rectangles of a polyomino.
211-214

- Margit Voigt:
List colourings of planar graphs.
215-219

- Cheng-De Wang:
On the harmoniousness of dicyclic groups.
221-225

- Martin Anthony, Norman Biggs:
The mean chromatic number of paths and cycles.
227-231

- Xiaomin Bao:
A constructing method of a class of SIDS(n).
233-239

- Andries E. Brouwer, Jacobus H. Koolen:
A new infinite series of regular uniformly geodetic code graphs.
241-247

- I. M. Chakravarti:
A three-class association scheme on the flags of a finite projective plane and a (PBIB) design defined by the incidence of the flags and the Baer subplanes in PG(2, q2).
249-252

- C. R. J. Clapham, J. Sheehan:
All trees are 1-embeddable and all except stars are 2-embeddable.
253-259

- James A. Davis:
New constructions of divisible designs.
261-268

- Dmitry Fon-Der-Flaass, Alexandr V. Kostochka:
Covering boxes by points.
269-275

- Yaakov S. Kupitz:
On convex segments in a triangulation.
277-285

- Daniel Q. Naiman, Henry P. Wynn:
A theorem on independence.
287-289

- Angelika Steger, Min-Li Yu:
On induced matchings.
291-295

- Xie-Hua Sun:
On Rota's problem of the explicit representation for umbral operators.
297-300

- Linda Valdes:
On the divisibility of the cycle number by 7.
301-305

- Hong Wang:
P2p-factorization of a complete bipartite graph.
307-308

Last update Fri May 24 20:15:48 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page