Full volume (ICA members only)

• A. Nakić, A few more Hadamard partitioned difference families, 54-72.
• G. Chartrand, E. Cheng, P. Zhang, Ascending Ramsey sequences in graphs, 73-92.
• W. Goddard, D. LaVey, Coloring graphs to produce walks without forbidden repeats, 93-110.
• M. Norge, P. LaBarr, I. Brooke Sanders, D. Taylor, Kings in products of digraphs, 111-122.
• A. Blecher, A. Knopfmacher, H. Prodinger, Left-to-right maxima in Dyck bridges and walks, 123-137.
• B. Freyberg, A. Hedtke, Neighborhood face-magic labelings of ladders, fans, and wheels, 138-150.
• F. Romaniello, V. Smaldore, On a graph isomorphic to \(NO^+(6,2)\), 151-161.

Full volume (ICA members only)

• F. Zuanni, A note on sets of type \((3,n)\) in \(\mathrm{PG}(3,q)\), 44-51.
• P.C. Kainen, S. Overbay, Graph embeddings with no hamiltonian extensions, 52-57.
• M. T. Ellumkalayil, S. Naduvath, On \(\delta^{(k)}\)-coloring of graph products, 58-90.
• J. Niyo, A. Erzurumluoğlu, Safe-sweep number of graphs, 91-115.
• S. Prajnanaswaroopa, J. Geetha, K. Somasundaram, Total, equitable and neighbor-sum distinguishing total colorings of some classes of circulant graphs, 116-132.
• G. Chartrand, C. Egan, P. Zhang, Zonal graphs revisited, 133-152.

Full volume (ICA members only)

• G. Chartrand, P. Zhang, A tale of two graphs, 30-42.
• G. Chartrand, P. Zhang, A chessboard problem and irregular domination, 43-59.
• D.R. Stinson, In the frame, 60-89.
• H.M. Hafez, R. El-Shanawany, A.A. El Atik, Odd harmonious labeling of the converse skew product of graphs, 90-110.
• G.-C. Lau, M. Nalliah, On local antimagic chromatic number of a corona product graph, 111-121.
• M.M. Ferrari, A. Pasotti, T. Traetta, On non-isomorphic biminimal pots realizing the cube, 122-139.
• D.L. Kreher, The extended graphical and bigraphical generalized Steiner systems, 140-147.

Full volume (ICA members only)

• J.M. Campbell, A proof via Zeilberger’s algorithm of Boole’s formula for factorials, 47-53.
• P. Hajnal, A short note on Zeckendorf type numeration systems with negative digits allowed, 54-66.
• D.A. Mojdeh, B. Samadi, I.G. Yero, Global offensive \(k\)-alliances in digraphs, 67-82.
• S. Saurabh, K. Sinha, Matrix approaches to constructions of group divisible designs, 83-105.
• J. Briggs, D. Hoffman, S.H. Holliday, P. Johnson, Self-colorings of graphs, 106-116.
• J. Calzadillas, D. McQuillan, Vertex-magic trees with \(n\) central vertices and \(kn\) leaves have bounded order for each \(k\) exceeding the square root of \(3\), 117-127.

Full volume (ICA members only)

• A. Byers, A. O'Mellan, An amalgamation of graceful and harmonious labelings, 53-67.
• D.M. Banegas, B.J. Freyberg, Distance quasi-magic regular graphs and some applications, 68-83.
• R. Sampathkumar, T. Sivakaran, \(4t\)-cycle decomposition of the \(2\)-fold tensor product \((K_m\times K_n)(2)\), 84-106.
• M. Kreh, J.-H. De Wiljes, Peg solitaire on corona products, 107-118.
• D. Hu, A. Sun, Probabilistic zero forcing on grid, regular, and hypercube graphs, 119-133.

Full volume (ICA members only)

• S. Das, S. Rai, Degree-based topological descriptors of type \(3\) rectangular hex-derived networks, 21-37.
• C.X. Kang, E. Yi, Distance-\(k\) locating-dominating sets in graphs, 38-56.
• K.M. Kathiresan, S. Muthumari and R. Ramalakshmi, Edge odd graceful labelings of certain new classes of graphs, 57-69.
• M. Abreu, D. Labbate, F. Romaniello, J. Sheehan, Even orientations and pfaffian graphs, 70-83.
• K.U. Divya, K. Somasundaram, Permanent dominance conjecture for derived partitions, 84-92.
• S. Saurabh, K. Sinha, Some matrix constructions of \(L_2\)-type Latin square designs, 93-104.

Full volume (ICA members only)

• M.J. Stinson, D.R. Stinson, An analysis and critique of the scoring method used for sport climbing at the 2020 Tokyo Olympics, 13-34.
• E. Munarini, A note on a definite integral of combinatorial interest, 35-52.
• A. Vázquez-Ávila, A note on the Buratti-Horak-Rosa conjecture about hamiltonian paths in complete graphs, 53-70.
• B.J. Freyberg, Corrigendum: Face-magic labelings of type \((a,b,c)\) from edge-magic labelings of type \(\alpha,\beta)\), 71-72.
• D.G. Sarvate, P.N. Shinde, Missing blocks of two designs in Hanani's paper, 73-78.
• D. Crnković, S. Rukavina, New symmetric \(2-(71,15,3)\) designs, 79-94.
• L. Mol, O.R. Oellermann, V. Oswal, On the average (edge-)connectivity of minimally \(k\)-(edge-)connected graphs, 95-110.

Full volume (ICA members only)

• A. Rosa, Anton Kotzig, the founder of graph theory in Slovakia, 16-44.
• J. Bao, M. Buratti, L. Ji, A note on almost partitioned difference families, 45-51.
• D. Froncek, M. Kubesa, Decompositions of complete graphs into connected unicyclic bipartite graphs with seven edges, 52-80.
• B. J. Freyberg, Face-magic labelings of type \((a,b,c)\) from edge-magic labelings of type \((\alpha,\beta)\), 81-103.
• R. Lakshmi, D. G. Sindhu, \((k,\ell)\)-kernels in \(P_m+e\), 104-118.
• É. Czabarka, J. Reiswig, L. Székely, The Steiner distance problem for large vertex subsets in the hypercube, 119-125.
• M. Ilayaraja, A. Shanmuga Vadivu, A. Muthusamy, Uniformly resolvable decompositions of \(K_n\) into \(1\)-factors and \(P_k\)-factors, 126-142.

Full volume (ICA members only)

• D. Pigozzi, Chaotic and euclidean rhythms, 40-49.
• P. Adams, R.C. Bunge, R.B. Eggleton, S.I. El-Zanati, U. Odabaşı, W. Wannasit, Decompositions of complete graphs and complete bipartite graphs into bipartite cubic graphs of order at most \(12\), 50-61.
• B. Carrigan, J. Hammer, J. Lorch, R. Lorch, C. Owens, List colorings count rokudoku-pair squares, 62-77.
• D. Mattiolo, G. Mazzuoccolo, V. Mkrtchyan, On sublinear approximations for the Petersen coloring conjecture, 78-90.
• M.A. Ollis, Roman and Vatican crossover designs, 91-108.
• D.R. Stinson, A die problem, 109-113.

Full volume (ICA members only)

• M. Prażmowska, K. Prażmowski, Configurations representing a skew perspective; a classification of \(15_4\,20_3)\)-configurations reflecting abstract properties of a perspective between tetrahedrons, 41-79.
• R.A. Beeler, A.D. Gray, Double jump peg solitaire on graphs, 80-93.
• B. Alspach, Honeycomb Toroidal Graphs, 94-114.
• R. Brier, D. Bryant, On the Steiner Quadruple System with Ten Points, 115-127.
• S.-I. Tashiro, K. Ogawa, M. Tsuchiya, Posets with series parallel orders and strict-double-bound graphs, 128-137.

Full volume (ICA members only)

• T. Sakurai, An explicit formula for a weight enumerator of linear-congruence codes, 34-38.
• R. Molinier, Comparing \(n\)-dice fixing the sum of the faces, 39-49.
• P. Heikoop, G.N. Ponasso, P. Ó Catháin, J. Pugmire, Morphisms of Skew Hadamard Matrices, 50-62.
• J.-H. de Wiljes, M. Kreh, Peg solitaire on banana trees, 63-86.
• A. Khodkar, D. Leach, B. Ellis, Signed magic rectangles with three filled cells in each column, 87-106.
• A. Globus, A. Parshall, Small unit-distance graphs in the plane, 107-138.
• J. Hallas, M. Talanda-Fisher, P. Zhang, Regular dominating functions in regular graphs, 139-157.

Full volume (ICA members only)

• Y. Caro, J. Lauri, C. Zarb, A note on totally-omnitonal graphs, 34-40.
• Z. Naghdabadi, A simple proof for the chromatic number of cyclic Latin squares of even order, 41-45.
• O. Polverino, F. Zullo, Connections between scattered linear sets and MRD-codes, 46-74.
• V. Roitner, Contacts and returns in \(2\)-watermelons without wall, 75-92.
• D.R. Stinson, Designing progressive dinner parties, 93-101.
• G.J. Simmons, Two related (?) \(2\)-edge-Hamiltonian bigraph conjectures addendum, 102-103.

Full volume (ICA members only)

• G. MacGillivray, S. Redlin, The firefighter problem on orientations of the cubic grid, 22-29.
• D. Froncek, J. Lee, Decomposition of complete graphs into bi-cyclic graphs with eight edges, 30-49.
• T.A. McKee, Distance-hereditary and strongly distance-hereditary graphs, 50-64.
• P.N. Shinde, S. Faruqi, S.A. Katre, On set graphs, 65-77.
• J. Hallas, E. Salehi, P. Zhang, Rainbow mean colorings of bipartite graphs, 78-97.
• G.J. Simmons, Two related (?) \(2\)-edge-Hamiltonian bigraph conjectures, 98-117.

Full volume (ICA members only)

• M. Meszka, A. Rosa, Cyclic and rotational six-cycle systems, 41-46.
• A.P. Ezhilarasi and A. Muthusamy, Decomposition of product graphs into paths and stars with three edges, 47-74.
• R.C. Bunge, S.I. El-Zanati, L. Haman, C. Hatzer, K. Koe, K. Spornberger, On loose \(4\)-cycle decompositions of complete \(3\)-uniform hypergraphs, 75-84.
• C. del Valle, P.J. Dukes, Some new block designs of dimension three, 85-102.
• A. Švob, Transitive distance-regular graphs from the unitary groups \(U(3,4)\), \(U(4,3)\) and \(U(5,2)\), 103-113.

Full volume (ICA members only)

• R.D. Dutton, R.C. Brigham, A new graph coloring scheme, 19-33.
• D. Froncek, J. Qiu, Balanced \(3\)-nearly Platonic graphs, 34-63.
• D.L. Kreher, D.R. Stinson, Nonsequenceable Steiner triple systems, 64-68.
• A. Erzurumluoğlu, On infection in hypergraphs, 69-84.
• R.A. Beeler, Palindromic graphs, 85-100.
• N.A. Loehr, Successor algorithms via counting arguments, 101-122.

Full volume (ICA members only)

• C. Meenakshi, K.M. Kathiresan, A generalization of magic labeling of two classes of graphs, 27-43.
• O.A. AbuGhneim, D. Peifer, K.W. Smith, All \((96,20,4)\) difference sets and related structures, 44-59.
• D.R. Stinson, Bounds for orthogonal arrays with repeated rows, 60-73.
• A. Rosa, Greedy triple systems, 74-78.
• Y. Caro, J. Lauri, C. Zarb, Notes on spreads of degrees in graphs, 79-91.
• G. Effinger, G.L. Mullen, Two extended Euler functions with applications to latin squares and bases of finite field extensions, 92-111.

Full volume (ICA members only)

• D.G. Sarvate, W. Cowden, A simple construction of \(3\)-GDDs with block size \(4\) using \(SQS(v)\), 40-44.
• M. DeVilbiss, P. Johnson, R. Matzke, Edge Grundy numbers of the regular Turán graphs, 45-52.
• D.D. Danilović, On some new resolvable \(1\)-rotational \((45,5,2)\)-BIBDs, 53-64.
• T. Chomko, K. McCall, A. McCleary, J. Shive, D.T. Taylor, Ring dominating functions in graph products, 65-78.
• J. Bubear, J.L. Hall, Skolem circles, 79-97.
• D. Froncek, You can't always get what you want \(\dots\), 98-108.

Full volume (ICA members only)

• 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, 29-51.
• G.J. Clark, G. Spencer, New bounds on the biplanar crossing number of low-dimensional hypercubes: How low can you go?, 52-60.
• K. Alhulwah, Z. Bi, A. Byers, M. Zayed, P. Zhang, Schwenk graphs of cages, 61-76.
• T.A. McKee, A \(k\)-partite generalization of chordal bipartite graphs, 77-83.
• D.R. Stinson, A brief retrospective look at the Cayley-Purser public-key cryptosystem, 19 years later, 84-97.
• M. Haythorpe, FHCP challenge set: The first set of structurally difficult instances of the hamiltonian cycle problem, 98-107.
• B. Freyberg, Regular \(d\)-handicap graphs of even order, 108-117.

Full volume (ICA members only)

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

Full volume (ICA members only)

• S. Allred, Theta Graphs are Hall \(t\)-chromatic for all \(t=0,1,2,\ldots\), 52-62.
• V. Alvarez, F. Gudiel, Diagram versus bundle equivalence for \({\mathbb Z}_t\times{\mathbb Z}_2^2\)-cocyclic Hadamard matrices, 63-77.
• D. Perkins, The length distribution for burn-off chip-firing games on complete graphs, 78-97.
• I. Anderson, M.A. Ollis, D.A. Preece, On Power-Sequence and Matryoshka Terraces for \({\mathbb{Z}}_n\), 98-117.
• H. Fu, Rainbow Cycle Designs, 118-130.

Full volume (ICA members only)

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

Full volume (ICA members only)

• Z. Bi, A. Byers, P.Zhang, Proper Hamiltonian-Connected Graphs, 48-65.
• R.D. Dutton, R.C. Brigham, Color Stable Graphs, 66-81.
• P.J. Larcombe, E.J. Fennessey, On sequence-based closed form entries for an exponentiated general \(2\times 2\) matrix: a re-formulation and an application, 82-94.
• C. Barrientos, S. Minion, Snakes: from Graceful to Harmonious, 95-107.
• J. Lind, F. Garcea, B. Mahon, R. Vargas, D.A. Narayan, Classroom Note: An Application of Edge Clustering Centrality to Brain Connectivity, 108-115.