Table of Contents

- A new graph coloring scheme, 19-33. ,
- Balanced \(3\)-nearly Platonic graphs, 34-63. ,
- Nonsequenceable Steiner triple systems, 64-68. ,
- On infection in hypergraphs, 69-84. ,
- Palindromic graphs, 85-100. ,
- Successor algorithms via counting arguments, 101-122. ,

Table of Contents

- A generalization of magic labeling of two classes of graphs, 27-43. ,
- All \((96,20,4)\) difference sets and related structures, 44-59. ,
- Bounds for orthogonal arrays with repeated rows, 60-73. ,
- Greedy triple systems, 74-78. ,
- Notes on spreads of degrees in graphs, 79-91. ,
- Two extended Euler functions with applications to latin squares and bases of finite field extensions, 92-111. ,

Table of Contents

- A simple construction of \(3\)-GDDs with block size \(4\) using \(SQS(v)\), 40-44. ,
- Edge Grundy numbers of the regular Turán graphs, 45-52. ,
- On some new resolvable \(1\)-rotational \((45,5,2)\)-BIBDs, 53-64. ,
- Ring dominating functions in graph products, 65-78. ,
- Skolem circles, 79-97. ,
- You can't always get what you want \(\dots\), 98-108. ,

Table of Contents

- Enumerating shortest paths and determining edge betweenness centrality in cartesian products of paths and cycles, 29-51. ,
- New bounds on the biplanar crossing number of low-dimensional hypercubes: How low can you go?, 52-60. ,
- Schwenk graphs of cages, 61-76. ,
- A \(k\)-partite generalization of chordal bipartite graphs, 77-83. ,
- A brief retrospective look at the Cayley-Purser public-key cryptosystem, 19 years later, 84-97. ,
- FHCP challenge set: The first set of structurally difficult instances of the hamiltonian cycle problem, 98-107. ,
- Regular \(d\)-handicap graphs of even order, 108-117. ,

Table of Contents

- \(K_{1,3}\)-subdivision representations with tolerance \(1\) and \(2\), 21-29. ,
- There is but one PDS in \({\mathbb Z}^3\) inducing just square components, 30-41. ,
- Shifting property and other binomial identities for the bivariate Fibonacci polynomials, 42-50. ,
- Not every bipartite double cover is canonical, 51-55. ,
- \(3\)-GDDs with block size \(4\), 56-71. ,
- Almost every non-negative integer contains \(\ldots\), 72-79. ,
- The harmonious number of graphs and related parameters, 80-95. ,

Table of Contents

- Theta Graphs are Hall \(t\)-chromatic for all \(t=0,1,2,\ldots\), 52-62. ,
- Diagram versus bundle equivalence for \({\mathbb Z}_t\times{\mathbb Z}_2^2\)-cocyclic Hadamard matrices, 63-77. ,
- The length distribution for burn-off chip-firing games on complete graphs, 78-97. ,
- On Power-Sequence and Matryoshka Terraces for \({\mathbb{Z}}_n\), 98-117. ,
- Rainbow Cycle Designs, 118-130. ,

Table of Contents

- On Edge Extremal Properties of Hamilton laceable bigraphs, 21-39. ,
- A new method for Constructing Circuit Codes, 40-60. ,
- An Intersection/Union Theorem for several Families of Finite Sets, 61-70. ,
- On a Decomposition of a non-simple \(5\)-design into \(3\)-designs, 71-78. ,
- Some Nonexistence Results for Strong External Difference Families using Character Theory, 79-92. ,
- The Graphs that Dahlhaus called "Good generalized strongly chordal", 93-98. ,
- Horadam sequences: a survey update and extension, 99-118. ,
- Classroom Note. Contributions of Graphs to Staff Rostering, 119-127. ,
- Classroom Note. Scheduling an Exciting Set of Rugby Matches, 128-136. ,

Table of Contents

- Proper Hamiltonian-Connected Graphs, 48-65. ,
- Color Stable Graphs, 66-81. ,
- On sequence-based closed form entries for an exponentiated general \(2\times 2\) matrix: a re-formulation and an application, 82-94. ,
- Snakes: from Graceful to Harmonious, 95-107. ,
- Classroom Note: An Application of Edge Clustering Centrality to Brain Connectivity, 108-115. ,