The Australasian Journal of Combinatorics

Volume 80 (2021)

• Part 1

  ---

• Hans van Ditmarsch, David Fernández Duque, Vaishnavi Sundararajan and SP. Suresh
  • Who holds the best card? Secure communication of optimal secret bits, pp.1–29

  ---

• W.H.W. Wong and E.G. Tay
  • On optimal orientations of complete tripartite graphs, pp.30–47

  ---

• Grahame Erskine, Peter Fratrič and Jozef Širáň
  • Graphs derived from perfect difference sets, pp.48–56

  ---

• Tianbing Xia, Guoxin Zuo, Mingyuan Xia and Liantang Lou
  • On construction of weighing matrices by negacyclic matrices, pp.57–78

  ---

• R. Lakshmi and T. Poovaragavan
  • 6-Cycle decompositions of complete 3-uniform hypergraphs, pp.79–88

  ---

• Terry A. McKee
  • Graphs that have separator tree representations, pp.89–98

  ---

• Maidoun Mortada, Amine El Sahili and Mouhamad El Joubbeh
  • About paths with three blocks, pp.99–105

  ---

• Sergi Elizalde
  • Bijections for restricted inversion sequences and permutations with fixed points, pp.106–115

  ---

• Anthony B. Evans
  • Orthogonal Latin square graphs based on groups of order 8, pp.116–142

  ---

• Paul Drube
  • Generalized path pairs and Fuss-Catalan triangles, pp.143–156

  ---

• Rebecca Patrias and Oliver Pechenik
  • Path-cordial abelian groups, pp.157–166

  ---

• Part 2

  ---

• P. Devi Priya and S. Monikandan
  • Reconstruction of 2-connected parity graphs, pp.167–177

  ---

• Gloria Rinaldi
  • Regular $1$-factorizations of complete graphs and decompositions into pairwise isomorphic rainbow spanning trees, pp.178–196

  ---

• Danny Dyer, Jared Howell and Brittany Pittman
  • The watchman's walk problem on directed graphs, pp.197–216

  ---

• F. Aguiló, M.A. Fiol and S. Pérez
  • The dilating method to obtain dense Cayley digraphs on finite abelian groups, pp.217–232

  ---

• Ryan C. Bunge, Brian D. Darrow, Jr., Saad I. El-Zanati, Kimberly P. Hadaway, Megan K. Pryor, Alexander J. Romer, Alexandra Squires and Anna C. Stover
  • On tight 9-cycle decompositions of complete 3-uniform hypergraphs, pp.233–240

  ---

• Salvatore Milici
  • A note on uniformly resolvable $\{P_4, C_6\}$-designs, pp.241–248

  ---

• Fiorenza Morini and Marco Antonio Pellegrini
  • Magic rectangles, signed magic arrays and integer $\lambda$-fold relative Heffter arrays, pp.249–280

  ---

• Part 3

  ---

• Yanxun Chang, Peter J. Dukes and Tao Feng
  • Leaves for packings with block size four, pp.281–304

  ---

• L.K. Mork, Keith Sullivan, Trenton Vogt and Darin J. Ulness
  • A group theoretical approach to the partitioning of integers: Application to triangular numbers, squares, and centered polygonal numbers, pp.305–321

  ---

• Giulio Cerbai
  • Sorting Cayley permutations with pattern-avoiding machines, pp.322–341

  ---

• Laura Chávez-Lomelí, Criel Merino, Guadalupe Rodríguez Sánchez and Geoffrey Whittle
  • A new polynomial for polymatroids, pp.342–360

  ---

• Joshua Carlson, Robin Eagleton, Jesse Geneson, John Petrucci, Carolyn Reinhart and Preetul Sen
  • The damage throttling number of a graph, pp.361–385

  ---

• Yehong Shao and Huiya Yan
  • On $s$-fully cycle extendable line graphs, pp.386–400

  ---

• Brandon Du Preez
  • Plane graphs with large faces and small diameter, pp.401–418

  ---

• Hemanshu Kaul, Jeffrey A. Mudrock and Michael J. Pelsmajer
  • On equitable list arboricity of graphs, pp.419–441

  ---

• Teresa W. Haynes, Jason T. Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae and Raghuveer Mohan
  • Upper bounds on the coalition number, pp.442–453

  ---