The Australasian Journal of Combinatorics

Volume 81 (2021)

• Part 1

  ---

• Audace A. V. Dossou-Olory and Stephan Wagner
  • Further results on the inducibility of $d$-ary trees, pp.1–24

  ---

• Richard Arratia and Stephen DeSalvo
  • Attacks and alignments: rooks, set partitions, and permutations, pp.25–45

  ---

• Roya Moghimipor
  • On the Wiener index of Cohen-Macaulay and very-well covered graphs, pp.46–57

  ---

• Darine Al-Mniny and Salman Ghazal
  • The second neighborhood conjecture for oriented graphs missing $\{C_4, \overline{C}_4, S_3, \text{chair and co-chair}\}$-free graph, pp.58–88

  ---

• Mukti Acharya, Joseph Varghese Kureethara and Thomas Zaslavsky
  • Characterizations of some parity signed graphs, pp.89–100

  ---

• Italo J. Dejter
  • Homogeneous edge-disjoint $K_{2s}$ and $T_{st,t}$ unions, pp.101–125

  ---

• Anton Dochtermann and Westin King
  • Trees, parking functions, and standard monomials of skeleton ideals, pp.126–151

  ---

• Anastasia Halfpap and Cory Palmer
  • Rainbow cycles versus rainbow paths, pp.152–169

  ---

• Rom Pinchasi
  • A theorem about vectors in $\mathbb{R}^2$ and an algebraic proof of a conjecture of Erdős and Purdy, pp.170–186

  ---

• Johanna Langner and Henryk A. Witek
  • Extended strict order polynomial of a poset and fixed elements of linear extensions, pp.187–207

  ---

• Naoki Matsumoto, Masaki Yamamoto and Masahito Yamazaki
  • The minimum number of vertices of graphs containing two monochromatic triangles for any edge $2$-coloring, pp.208–232

  ---

• Carl Johan Casselgren and Fikre B. Petros
  • Edge precoloring extension of trees, pp.233–244

  ---

• Part 2

  ---

• Fred Rowley
  • A generalised linear Ramsey graph construction, pp.245–256

  ---

• Michael Fuchs, Bernhard Gittenberger and Marefatollah Mansouri
  • Counting phylogenetic networks with few reticulation vertices: exact enumeration and corrections, pp.257–282

  ---

• Magdalena Łysakowska
  • The structure of cube tilings, pp.283–300

  ---

• Marina Groshaus and Leandro Montero
  • Structural properties of biclique graphs and the distance formula, pp.301–318

  ---

• sarah-marie belcastro
  • Color-induced subgraphs dual to Hamilton cycles of embedded cubic graphs, pp.319–333

  ---

• Carsten Thomassen and Carol T. Zamfirescu
  • $4$-regular $4$-connected Hamiltonian graphs with a bounded number of Hamiltonian cycles, pp.334–338

  ---

• Part 3

  ---

• Eileen Melville, Beth Novick and Svetlana Poznanović
  • On reconfiguration graphs: an abstraction, pp.339–356

  ---

• Pavol Jánoš and Dávid Mesežnikov
  • An upper bound on the order of graphs of diameter two arising as Abelian lifts of multigraphs, pp.357–366

  ---

• Alyssa Adams and Bonnie Jacob
  • Failed zero forcing and critical sets on directed graphs, pp.367–387

  ---

• Lucas J. Rusnak, Josephine Reynes, Skyler J. Johnson and Peter Ye
  • Generalizing Kirchhoff laws for signed graphs, pp.388–411

  ---

• Michael C. Strayer
  • Classifications of $\Gamma$-colored minuscule posets and $P$-minuscule Kac-Moody representations, pp.412–446

  ---

• Toufik Mansour and José L. Ramírez
  • Enumerations on polyominoes determined by Fuss-Catalan words, pp.447–457

  ---

• Timothy B. Flowers and Shannon R. Lockard
  • Conjugate $m$-ary partitions, pp.458–473

  ---

• Angelot Behajaina, Roghayeh Maleki and Andriaherimanana Sarobidy Razafimahatratra
  • On non-normal subgroup perfect codes, pp.474–479

  ---

• Sebastian M. Cioabă, Gordon Royle, Zhao Kuang Tan
  • On the flip graphs on perfect matchings of complete graphs and signed reversal graphs, pp.480–497

  ---