The Australasian Journal of Combinatorics

Volume 91 Parts 1 and 2 (2025)

• Part 1

  ---

• John T. Griesmer
  • Separating topological recurrence from measurable recurrence: exposition and extension of Kriz's example, pp.1–19

  ---

• Christopher Duffy, Gary MacGillivray and Ben Tremblay
  • Switching m-edge-coloured graphs using non-abelian groups, pp.20–31

  ---

• Martin Rolek and Paul Scemama
  • Planar graphs with no incident triangles and no 4- or 5-cycles are (7:2)-colorable, pp.32–40

  ---

• Svjetlan Feretić
  • Pyramids of segments: nice new formulas with bijective proofs, pp.41–66

  ---

• Ana Paulina Figueroa, Juan José Montellano-Ballesteros and Mika Olsen
  • Hamiltonian connected balanced multipartite tournaments and hamiltonian connected partitions, pp.67–76

  ---

• Daniel Slilaty
  • On colorings and orientations of signed graphs II, pp.77–83

  ---

• A. D. Forbes and C. G. Rutherford
  • Design spectra for 6-regular graphs with 12 vertices, pp.84–103

  ---

• Brandon Du Preez
  • The degree-diameter problem for plane graphs with pentagonal faces, pp.104–147

  ---

• Douglas R. Stinson
  • Weak and strong nestings of BIBDs, pp.148–176

  ---

• Toufik Mansour and Mark Shattuck
  • Avoidance of vincular patterns by Catalan words, pp.177–216

  ---

• Melissa A. Huggan, M.E. Messinger and Amanda Porter
  • Corrigendum to: The damage number of the Cartesian product of graphs, pp.217–218

  ---

• Part 2

  ---

• Xinle Dai, Jordan Long and Karen Yeats
  • Subdivergence-free gluings of trees, pp.219–241

  ---

• Ahmad H. Alkasasbeh, Danny Dyer and Nabil Shalaby
  • Applying Skolem sequences to gracefully label new families of triangular windmills, pp.242–265

  ---

• Vic Bednar and Neal Bushaw
  • Rainbow Turán methods for trees, pp.266–281

  ---

• Ayman El Zein
  • About kings and dominating sets in tournaments, pp.282–300

  ---

• Tanya Khovanova and Atharva Pathak
  • Combinatorial aspects of the card game War, pp.301–325

  ---