Volume 66, Numbers 1-2, August 1987
Endre Boros:
On a linear diophantine problem for geometrical type sequences. 27-33
Kevin J. Compton:
Some methods for computing component distribution probabilities in relational structures. 59-77
Bill Jackson:
Compatible Euler tours for transition systems in Eulerian graphs. 127-131
Inessa Levi:
Order-automorphisms of normal subsets of a power set. 139-155
Zbigniew Lonc:
Decompositions of hypergraphs into hyperstars. 157-168
Dragan Marusic:
Hamiltonian cycles in vertex symmetric graphs of order 2P2. 169-174
Volume 66, Number 3, September 1987
Jeanette P. Schmidt:
Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number. 259-277
Tamás Szonyi:
Note on the order of magnitude of k for complete k-arcs in PG(2, q). 279-282
Serge Lavrenchenko:
An infinite set of torus triangulations of connectivity 5 whose graphs are not uniquely embeddable in the torus. 299-301
Ioan Tomescu:
Graphical Eulerian numbers and chromatic generating functions. 315-318