Refereed reprints from the Bulletin of the ICA
Issue 80 (2017)

G.J. Simmons,
On Edge Extremal Properties of Hamilton laceable bigraphs,
.

K.M. Byrnes,
A new method for Constructing Circuit Codes,
.

A.H.W. Hilton,
An Intersection/Union Theorem for several Families of Finite Sets,
.

I. Bluskov, A. James,
On a Decomposition of a nonsimple \(5\)design into \(3\)designs,
.

W.J. Martin, D.R. Stinson,
Some Nonexistence Results for Strong External Difference Families using Character Theory,
.

T.A. McKee,
The Graphs that Dahlhaus called "Good generalized strongly chordal",
.

P.J. Larcombe,
Horadam sequences: a survey update and extension,
.

J. Lind,
Classroom Note. Contributions of Graphs to Staff Rostering,
.

J. Lind,
Classroom Note. Scheduling an Exciting Set of Rugby Matches,
.
Issue 79 (2017)

Z. Bi, A. Byers, P.Zhang,
Proper HamiltonianConnected Graphs,
.

R.D. Dutton, R.C. Brigham,
Color Stable Graphs,
.

P.J. Larcombe, E.J. Fennessey,
On sequencebased closed form entries for an exponentiated general \(2\times 2\) matrix: a reformulation and an application,
.

C. Barrientos, S. Minion,
Snakes: from Graceful to Harmonious,
.

J. Lind, F. Garcea, B. Mahon, R. Vargas, D.A. Narayan,
Classroom Note: An Application of Edge Clustering Centrality to Brain Connectivity,
.