The Australasian Journal of Combinatorics

Volume 87 (2023)

• Part 1

  ---

• A. D. Forbes
  • Group divisible designs with block size five, pp.1–11

  ---

• Zhongyuan Che
  • (k+1)-line graphs of k-trees, pp.12–23

  ---

• Joe Miller and Nathan Warnberg
  • Anti-van der Waerden numbers of graph products of cycles, pp.24–40

  ---

• Michael Levet
  • On the complexity of identifying strongly regular graphs, pp.41–67

  ---

• Kunxuan Gu, Fujie Zhang and Haitao Cao
  • The existence of (1,m)-near-Skolem sequences, pp.68–85

  ---

• Xiangwen Li and Mao Zhang
  • Every planar graph without 5-cycles adjacent to 6-cycles is DP-4-colorable, pp.86–97

  ---

• Stoyan Dimitrov
  • On permutation patterns with constrained gap sizes, pp.98–128

  ---

• Lisa Cenek, Lizzie Ferguson, Eyobel Gebre, Cassandra Marcussen, Jason Meintjes, Ralph Morrison, Liz Ostermeyer and Shefali Ramakrishna
  • Uniform scrambles on graphs, pp.129–147

  ---

• Amir Carmel and Rom Pinchasi
  • Some notes about the odd area of unit discs centered at points on a circle, pp.148–159

  ---

• Robert Hickingbotham
  • Odd colourings, conflict-free colourings and strong colouring numbers, pp.160–164

  ---

• Henry L. Fleischmann, Steven J. Miller, Eyvindur A. Palsson, Ethan Pesikoff and Charles Wolf
  • Optimal point sets determining few distinct angles, pp.165–181

  ---

• Allan Bickle
  • 2-Tone coloring of chordal and outerplanar graphs, pp.182–197

  ---

• Zhe Wang and Zhi-Yong Zhu
  • The spiral property of q-Eulerian numbers of type B, pp.198–202

  ---

• Akihiro Higashitani and Naoki Matsumoto
  • Kempe equivalence of almost bipartite graphs, pp.203–213

  ---

• Part 2

  ---

• Daniel McGinnis and Nathan Shank
  • Extremal problems related to the cardinality-redundance of graphs, pp.214–238

  ---

• R. Srimathi
  • Packings and coverings of lambda-fold line graphs of the complete graph with $k$-cycles, for $k=4,6$, pp.239–257

  ---

• Alberto Seeger and David Sossa
  • Infinite families of connected graphs with equal spectral radius, pp.258–276

  ---

• Manoel Lemos
  • The 3-connected binary matroids with circumference 8, part I, pp.277–300

  ---

• Simone Costa and Stefano Della Fiore
  • Existence of $\lambda$-fold non-zero sum Heffter arrays through local considerations, pp.301–339

  ---

• Francesco Pavese and Hanlin Zou
  • An infinite family of $m$-ovoids of the hyberbolic quadrics $Q^+(7,q)$, pp.340–351

  ---

• Zachary Hamaker and Vincent Vatter
  • Three coloring via triangle counting, pp.352–356

  ---

• Jinshui Guo and Weigen Yan
  • Enumerating spanning trees of a graph with edge constraints, pp.357–364

  ---

• Part 3

  ---

• Fang Tian, Zi-Long Liu and Xiang-Feng Pan
  • On the random greedy linear uniform hypergraph packing, pp.365–390

  ---

• David Callan and Toufik Mansour
  • Three classes of inversion sequences counted by large Schröder numbers, pp.391–402

  ---

• Anastasia Halfpap
  • The rainbow Turán number of $P_5$, pp.403–422

  ---

• Yoshimi Egawa, Masao Tsugaki and Takamasa Yashima
  • A minimum degree condition for the existence of $S$-path-systems in bipartite graphs, pp.423–439

  ---

• Andrzej Dudek, Jarosław Grytczuk and Andrzej Ruciński
  • Multiple twins in permutations, pp.440–451

  ---