The Australasian Journal of Combinatorics

Volume 75 (2019)

• Part 1

  ---

• Danielle Cox and Asiyeh Sanaei
  • The damage number of a graph, pp.1–16

  ---

• Naoki Matsumoto
  • Triangles in uniquely 3-colorable graphs on surfaces, pp.17–31

  ---

• S. Akbari, M. Chavooshi, M. Ghanbari and R. Manaviyat
  • Some results on the f-chromatic index of graphs whose f-core has maximum degree 2, pp.32–49

  ---

• Konstantinos Papalamprou and Christoforos Raptopoulos
  • Balance in random signed intersection graphs, pp.50–65

  ---

• Florian Lehner
  • Firefighting on trees and Cayley graphs, pp.66–72

  ---

• Jordan Lambert and Lonardo Rabelo
  • Covering relations of $k$-Grassmannian permutations of type B, pp.73–95

  ---

• Joshua Carlson
  • Throttling for zero forcing and variants, pp.96–112

  ---

• Antal Joós
  • On covering the square flat torus by congruent discs, pp.113–126

  ---

• Iain Beaton, Jason I. Brown and Ben Cameron
  • Independence equivalence classes of paths and cycles, pp.127–145

  ---

• Selda Küçükçifçi, Charles Curtis Lindner, Sibel Özkan and Emine Şule Yazıcı
  • Maximum packings of inside perfect $8$-cycle systems, pp.146–157

  ---

• Malhar M. Mukhopadhyay and Evgueni Vassiliev
  • On the Vamos matroid, homogeneous pregeometries and dense pairs, pp.158–170

  ---

• Mark Budden and Andrew Penland
  • Corrigendum: Trees and $n$-good hypergraphs, pp.171–173

  ---

• Part 2

  ---

• Alexander Diaz-Lopez, Lucas Everham, Pamela E. Harris, Erik Insko, Vincent Marcantonio and Mohamed Omar
  • Counting peaks on graphs, pp.174–189

  ---

• Peter Bernstein, Cashous Bortner, Samuel Coskey, Shuni Li and Connor Simpson
  • The set splittability problem, pp.190–209

  ---

• S. Heil and C. Ji
  • On an algorithm for comparing the chromatic symmetric functions of trees, pp.210–222

  ---

• Simona Settepanella and Michele Torielli
  • On an explicit correspondence between $nbc$-basis, chambers and minimal complex for real supersolvable arrangements, pp.223–245

  ---

• Soňa Pavlíková and Jozef Širáň
  • Inverting non-invertible labeled trees, pp.246–255

  ---

• Maurizio Brunetti, Matteo Cavaleri and Alfredo Donno
  • Erratum to the article 'A lexicographic product for signed graphs', pp.256–258

  ---

• Part 3

  ---

• Howida A. Al Fran, David J.W. Simpson and Christopher P. Tuffley
  • Characterisation and classification of signatures of spanning trees of the $n$-cube, pp.259–295

  ---

• Zi-Xia Song and Jingmei Zhang
  • A conjecture on Gallai-Ramsey numbers of even cycles and paths, pp.296–308

  ---

• Eugene Curtin and Suho Oh
  • A combinatorial problem from group theory, pp.309–315

  ---

• Brett Stevens
  • Non-uniform covering array with symmetric forbidden edge constraints, pp.316–321

  ---

• Grant Cairns, Emily Groves and Yuri Nikolayevsky
  • Bad drawings of small complete graphs, pp.322–342

  ---

• Jocelyn R. Bell and Desmond F. Cummins
  • Graceful pairings , pp.343–356

  ---

• Peter J. Cameron and Sean Eberhard
  • Association schemes for diagonal groups, pp.357–364

  ---

• Julien Bensmail
  • On the 2-edge-coloured chromatic number of grids, pp.365–384

  ---