Volume 59,
Numbers 1-2,
April 1986
- Kenneth A. Berman:
Parity results on connected f-factors.
1-8
- Wayne M. Dymàcek:
Bipartite Steinhaus graphs.
9-20
- Paul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress:
Coloring graphs with locally few colors.
21-34
- Hortensia Galeana-Sánchez:
A theorem about a conjecture of H. Meyniel on kernel-perfect graphs.
35-41
- David G. Glynn:
The non-classical 10-arc of PG(4, 9).
43-51
- Michael Hager:
Path-connectivity in graphs.
53-59
- András Hajnal, N. Sauer:
Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets.
61-67
- Katherine Heinrich, L. Zhu:
Existence of orthogonal latin squares with aligned subsquares.
69-78
- Alain Hertz:
Quelques utilisations de la struction.
79-89
- Vikram Jha, Norman L. Johnson:
Regular parallelisms from translation planes.
91-97
- R. P. Nederpelt:
Bijections between formulae and trees which are compatible with equivalences of the type ((f·g)·h)~((f·h)·g).
99-105
- P. J. Owens:
Simple 3-polytopal graphs with edges of only two types and shortness coefficients.
107-114
- D. Piollet:
Solutions d'une equation quadratique dans le groupe libre.
115-123
- Vojtech Rödl:
On universality of graphs with uniformly distributed edges.
125-134
- Michael E. Saks:
Some sequences associated with combinatorial structures.
135-166
- Yongbing Shi:
Some theorems of uniquely pancyclic graphs.
167-180
- R. J. Simpson:
Exact coverings of the integers by arithmetic progressions.
181-190
- Mauro Cerasoli:
Enumeration with the lattice of periods.
191-198
- A. Patricia Shelton, Ronald D. Dutton, Robert C. Brigham:
Extension of a clique cover result to uniform hypergraphs.
199-201
Volume 59,
Number 3,
May 1986
Copyright © Wed Dec 9 20:20:58 2009
by Michael Ley (ley@uni-trier.de)
