The Australasian Journal of Combinatorics

Volume 90 Parts 1, 2 and 3 (2024)

• Part 1

  ---

• Todd Mullen, Richard J. Nowakowski and Danielle Cox
  • Diffusion: quiescence and perturbation, pp.1–14

  ---

• Matt Noble
  • Assorted musings on dimension-critical graphs, pp.15–28

  ---

• Devin C. Jean and Suk J. Seo
  • Fault-tolerant locating-dominating sets on the infinite tumbling block graph, pp.29–45

  ---

• Dave Witte Morris and Joy Morris
  • Non-Cayley-Isomorphic Cayley graphs from non-Cayley-Isomorphic Cayley digraphs, pp.46–59

  ---

• Dickson Y.B. Annor
  • On $r$-equichromatic lines with few points in $C^2$, pp.60–65

  ---

• Mark Budden and Bruce Landman
  • Rainbow numbers for the generalized Schur equation $x_1 + x_2 + ... +x_{m-1} = x_m$, pp.66–79

  ---

• Jakub Kwaśny and Marcin Stawiski
  • List proper connection of 2-edge-connected graphs, pp.80–84

  ---

• Xingzhi Zhan
  • The minimum number of detours in graphs, pp.85–93

  ---

• Part 2

  ---

• Darine Al-Mniny
  • On bispindles B(k_1,k_2;1) in strongly connected digraphs with large chromatic number, pp.94–109

  ---

• Asahi Takaoka
  • Computing shortest 12-representants of labeled graphs, pp.110–120

  ---

• Marni Mishna and Stefan Trandafir
  • Estimating and computing Kronecker coefficients: a vector partition function approach, pp.121–154

  ---

• Maidoun Mortada and Olivier Togni
  • On $S$-packing coloring of 2-saturated subcubic graphs, pp.155–167

  ---

• Matthew J. Dyer
  • Poincaré series of Coxeter groups and multichains in Eulerian posets, pp.168–186

  ---

• Marco Barbieri and Pablo Spiga
  • On the number of generators of groups acting arc-transitively on graphs, pp.187–198

  ---

• Part 3

  ---

• Paulo Henrique Arruda and Lorenzo Luperi Baglini
  • Rado functionals and applications, pp.199–230

  ---

• Yoshimi Egawa
  • Forbidden caterpillars for 3-connected graphs with girth at least five, pp.231–261

  ---

• Anita Keszler and Zsolt Tuza
  • Hypercycle systems from semi-parallel classes, pp.262–280

  ---

• Dean Hoffman, Peter Johnson, Matt Noble, Andrew Owens, Gregory J. Puleo and Nico Terry
  • Proper rainbow-cycle-forbidding edge colorings of graphs, pp.281–312

  ---

• Yair Caro, Matthew Cassar, Josef Lauri and Christina Zarb
  • The feasibility problem: the family F(G) of all induced G-free graphs., pp.313–325

  ---

• Dániel Gerbner and Hilal Hama Karim
  • Generalized regular Turán numbers, pp.326–340

  ---

• Doriann Albertin, Jean-Christophe Aval and Hugo Mlodecki
  • Quasysimmetric invariants for families of posets, pp.341–356

  ---

• Ginji Hamano, Ichiro Sainose and Takayuki Hibi
  • Lattice polytopes with the minimal volume, pp.357–362

  ---

• Boris Brimkov and Joshua Carlson
  • Minimal zero forcing sets, pp.363–377

  ---

• Jonathan Calzadillas and Dan McQuillan
  • Does the degree sequence of an (almost) regular graph determine if it possesses a strong vertex-magic total labeling?, pp.378–392

  ---