The Australasian Journal of Combinatorics

Volume 77 (2020)

• Part 1

  ---

• Kean Fallon, Colin Giles, Hunter Rehm, Simon Wagner and Nathan Warnberg
  • Rainbow numbers of $[n]$ for $\sum_{i=1}^{k-1} x_i = x_k$ , pp.1–8

  ---

• Mehtaab Sawhney and David Stoner
  • Hypercube packings and coverings with higher dimensional rooks, pp.9–34

  ---

• Aleksandar Bikov and Nedyalko Nenov
  • On the independence number of $(3,3)$-Ramsey graphs and the Folkman number $F_e(3,3;4)$, pp.35–50

  ---

• Colin Defant and Noah Kravitz
  • Stack-sorting for words, pp.51–68

  ---

• Masao Tsugaki and Tomoki Yamashita
  • On a spanning tree with specified leaves in a bipartite graph, pp.69–86

  ---

• Douglas R. Stinson and Shannon Veitch
  • Block-avoiding point sequencings of arbitrary length in Steiner triple systems, pp.87–99

  ---

• N. N. Avdeev
  • On existence of integral point sets and their diameter bounds, pp.100–116

  ---

• Julien Bensmail, Soumen Nandi, Mithun Roy and Sagnik Sen
  • Enumeration of edge-critical underlying absolute planar cliques for signed graphs, pp.117–135

  ---

• Ruixia Wang and Linxin Wu
  • A dominating pair condition for a balanced bipartite digraph to be hamiltonian, pp.136–143

  ---

• Part 2

  ---

• Kelly Guest, Sarah Holliday, Peter Johnson, Dieter Rautenbach and Matthew Walsh
  • Closed-neighborhood union-closed graphs, pp.144–156

  ---

• Béata Bényi, José L. Ramirez and Miguel Méndez
  • Generalized ordered set partitions, pp.157–179

  ---

• Gábor Hegedűs
  • Difference sets and power residues, pp.180–183

  ---

• Eric Swartz and Nicholas J. Werner
  • On the number of reachable pairs in a digraph, pp.184–223

  ---

• Yuanqiu Huang, Tinglei Zhao and Zongpeng Ding
  • Graphs whose crossing numbers are the same as those of their line graphs, pp.224–248

  ---

• Sam Spiro
  • Counting labeled threshold graphs with Eulerian numbers, pp.249–255

  ---

• S. Nazari-Moghaddam and M. Chellali
  • On the double Roman domination number in trees, pp.256–268

  ---

• Guifu Su, Zihao Li and Huichao Shi
  • Sufficient conditions for a graph to be $k$-edge-hamiltonian, $k$-path-coverable, traceable and Hamilton-connected, pp.269–284

  ---

• Michal Parnas and Adi Shraibman
  • On maximal isolation sets in the uniform intersection matrix, pp.285–300

  ---

• Part 3

  ---

• Weili Guo and Michele Torielli
  • On the Falk invariant of hyperplane arrangements attached to gain graphs, pp.301–317

  ---

• Jeremiah Bartz, Bruce Dearden and Joel Iiams
  • Counting families of generalized balancing numbers, pp.318–325

  ---

• Christopher R.H. Hanusa and Thomas Zaslavsky
  • A $q$-queens problem VII: Combinatorial types of nonattacking chess riders, pp.326–335

  ---

• Mario Gionfriddo, Lorenzo Milazzo and Zsolt Tuza
  • Hypercycle systems, pp.336–354

  ---

• Ronald J. Gould, Kazuhide Hirohata and Ariel Keller Rorabaugh
  • On independent triples and vertex-disjoint chorded cycles in graphs, pp.355–372

  ---

• Paul Renteln
  • Some constraints on the missing Moore graph, pp.373–382

  ---

• Cong X. Kang, Gretchen L. Matthews and Justin D. Peachey
  • On Laplacian monopoles, pp.383–397

  ---

• Adrian Beker
  • The star avoidance game, pp.398–405

  ---