Refereed reprints from the Bulletin of the ICA
Issue 83 (2018)
Table of Contents

A. Strang, O. Haynes, R. Flórez, D.A. Narayan,
Enumerating shortest paths and determining edge betweenness centrality in cartesian products of paths and cycles,
.

G.J. Clark, G. Spencer,
New bounds on the biplanar crossing number of lowdimensional hypercubes: How low can you go?,
.

K. Alhulwah, Z. Bi, A. Byers, M. Zayed, P. Zhang,
Schwenk graphs of cages,
.

T.A. McKee,
A \(k\)partite generalization of chordal bipartite graphs,
.

D.R. Stinson,
A brief retrospective look at the CayleyPurser publickey cryptosystem, 19 years later,
.

M. Haythorpe,
FHCP challenge set: The first set of structurally difficult instances of the hamiltonian cycle problem,
.

B. Freyberg,
Regular \(d\)handicap graphs of even order,
.
Issue 82 (2018)
Table of Contents

M.A. Barbato,
\(K_{1,3}\)subdivision representations with tolerance \(1\) and \(2\),
.

C.A. Araujo,
There is but one PDS in \({\mathbb Z}^3\) inducing just square components,
.

E. Munarini,
Shifting property and other binomial identities for the bivariate Fibonacci polynomials,
.

T. Pisanski,
Not every bipartite double cover is canonical,
.

D.G. Sarvate,
\(3\)GDDs with block size \(4\),
.

I. Broere,
Almost every nonnegative integer contains \(\ldots\),
.

R. Ichishima,
The harmonious number of graphs and related parameters,
.
Issue 81 (2017)
Table of Contents

S. Allred,
Theta Graphs are Hall \(t\)chromatic for all \(t=0,1,2,\ldots\),
.

V. Alvarez, F. Gudiel,
Diagram versus bundle equivalence for \({\mathbb Z}_t\times{\mathbb Z}_2^2\)cocyclic Hadamard matrices,
.

D. Perkins,
The length distribution for burnoff chipfiring games on complete graphs,
.

I. Anderson, M.A. Ollis, D.A. Preece,
On PowerSequence and Matryoshka Terraces for \({\mathbb{Z}}_n\),
.

H. Fu,
Rainbow Cycle Designs,
.
Issue 80 (2017)
Table of Contents

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)
Table of Contents

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,
.