The Australasian Journal of Combinatorics

Volume 83 (2022)

• Part 1

  ---

• Joe Gildea, Abidin Kaya, Alexander Tylyshchak and Bahattin Yildiz
  • A group induced four-circulant construction for self-dual codes and new extremal binary self-dual codes, pp.1–19

  ---

• Kevin Akers, Stacie Baumann, Sarah Gustafson, Jaromy Kuhl, Olivia Mosrie and Michael W. Schroeder
  • On a completion problem for Latin arrays, pp.20–39

  ---

• Marefatollah Mansouri
  • Counting general phylogenetic networks, pp.40–86

  ---

• Rosário Fernandes
  • On the switch-length of two connected graphs with the same degree sequence, pp.87–100

  ---

• R. Khoeilar, H. Karami, M. Chellali and S.M. Sheikholeslami
  • Note on the domination number of graphs with forbidden cycles of lengths not divisible by 3, pp.101–108

  ---

• H.W. Willie Wong and E.G. Tay
  • Optimal orientations of vertex-multiplications of Cartesian products of graphs, pp.109–128

  ---

• Griffin Johnston, Michael Tait and Craig Timmons
  • Upper and lower bounds on the size of $B_{k}[g]$ sets, pp.129–140

  ---

• Qinghong Zhao and Bing Wei
  • Gallai-Ramsey numbers for graphs with five vertices and chromatic number four, pp.141–162

  ---

• Michael A. Henning and Jerzy Topp
  • Graphs with disjoint $2$-dominating sets, pp.163–172

  ---

• Shabnam Malik
  • Corrigendum and extension to the "Hamiltonicity in directed Toeplitz graphs $T_{n}\langle 1, 2; t_1, t_2 \rangle$", pp.173–175

  ---

• Toufik Mansour and Mark Shattuck
  • On a question of Li concerning an uncounted class of circular permutations, pp.176–195

  ---

• Part 2

  ---

• Naoki Matsumoto, Koji Momihara and Mio Nakamura
  • Avoidance game on Steiner triple systems, pp.196–203

  ---

• Joy Morris, Tigana Runte and Adrian Skelton
  • Most generalized Petersen graphs of girth $8$ have cop number $4$, pp.204–224

  ---

• Debra Boutin, Sally Cockburn, Lauren Keough, Sarah Loeb, K.E. Perry and Puck Rombach
  • Distinguishing generalized Mycielskian graphs, pp.225–242

  ---

• Jesse Geneson and Eunjeong Yi
  • Broadcast dimension of graphs, pp.243–264

  ---

• Yuqing Lin, Weigen Yan and Zhangdong Ouyang
  • On the $p$-restricted edge connectivity of the bipartite Kneser graph $H(n,k)$, pp.265–273

  ---

• Richard A. Brualdi and Lei Cao
  • Blockers of pattern avoiding permutation matrices, pp.274–303

  ---

• Batoul Tarhini and Maidoun Mortada
  • On paths with three blocks $P(k, 1, l)$, pp.304–311

  ---

• Part 3

  ---

• Kathryn Beck, Lisa Cenek, Megan Cream and Brittany Gelb
  • Chorded pancyclic properties in claw-free graphs, pp.312–336

  ---

• Jeremiah Bartz, Bruce Dearden and Joel Iiams
  • Jump sizes for polygonal balancing numbers, pp.337–347

  ---

• Alvaro Carbonero
  • On sequences of $P_n$-line graphs, pp.348–360

  ---

• Stephen J. Curran
  • $C_4$-face-magic labelings on odd order projective grid graphs, pp.361–396

  ---

• Jesse Geneson and Leslie Hogben
  • Expected propagation time for probabilistic zero forcing, pp.397–417

  ---

• Marilena Barnabei, Flavio Bonetti, Niccolò Castronuovo and Matteo Silimbani
  • Pattern avoiding meandric permutations, pp.418–434

  ---

• Moussa Barro, Idrissa Kaboré and K. Ernest Bognini
  • On the palindromic zl-factorization and c-factorization of the generalized period-doubling sequences, pp.435–447

  ---

• Brendan D. McKay
  • Reconstruction of small graphs and digraphs, pp.448–457

  ---