Volume 9, Number 1, March 1993
Andrew Vince:
The classification of closed surfaces using colored graphs.
75-84
Volume 9, Numbers 2-4, June 1993
C. Coker:
A problem related to Foulkes's conjecture.
117-134
Alain Hertz:
Most unbreakable murky graphs are bull-free.
173-175
Bruce M. Landman:
An upper bound for van der Waerden-like numbers using k colors.
177-184
Jeffrey Shallit:
On the maximum number of distinct factors of a binary string.
197-200
Ron Aharoni:
On a criterion for matchability in hypergraphs.
209-212
Laura M. Chihara:
Askey-Wilson polynomials, kernel polynomials and association schemes.
213-223
Alexandr V. Kostochka:
The independent domination number of a cubic 3-connected graph can be much larger than its domination number.
235-237
D. G. Rogers:
On the BKT inequality and improved bounds for perfect systems of difference sets.
265-278
John Howard Smith:
Combinatorial congruences from p -subgroups of the symmetric group.
293-304
Weizhen Gu:
On minimal embedding of two graphs as center and periphery.
315-323
Erich Prisner:
The dynamics of the line and path graph operators.
335-352
Bing Wei:
A generalization of a result of Bauer and Schmeichel.
383-389
Yue Zhao:
On the edge reconstruction of graphs embedded on surfaces.
391-395
data released under the ODC-BY 1.0 license
