The Australasian Journal of Combinatorics

Volume 74 (2019)

• Part 1

  ---

• Norbert Hegyvári, François Hennecart and Péter Pál Pach
  • On the density of sumsets and product sets, pp.1–16

  ---

• R. Balakrishnan, P. Paulraja, Wasin So and M. Vinay
  • Some properties of the Knödel graph $W(k,2^{k})$, $k\ge 4$, pp.17–32

  ---

• Irith Ben-Arroyo Hartman and Ilan Newman
  • Contractors' minimum spanning tree, pp.33–45

  ---

• Jaromy Kuhl, Donald McGinn and Michael William Schroeder
  • On the existence of partitioned incomplete Latin squares with five parts, pp.46–60

  ---

• J. Amjadi, M. Chellali, S.M. Sheikholeslami and M. Soroudi
  • On two open problems concerning weak Roman domination in trees, pp.61–73

  ---

• K. Selvakumar, M. Subajini and M. J. Nikmehr
  • On the genus of essential graph of commutative rings, pp.74–85

  ---

• L. Beaudou, R.C. Brewster and F. Foucaud
  • Broadcast domination and multipacking: bounds and the integrality gap, pp.86–97

  ---

• Michael Engen and Vincent Vatter
  • On the dimension of downsets of integer partitions and compositions, pp.98–111

  ---

• Kenzi Akiyama, Chihiro Suetake and Masaki Tanaka
  • The nonexistence of projective planes of order 12 with a collineation group of order 9, pp.112–160

  ---

• Doug J. Decock and Breeann M. Flesch
  • Asteroidal-triple-free interval $k$-graphs, pp.161–168

  ---

• Toufik Mansour, Matthias Schork and Daniel Yaqubi
  • Protected cells in bargraphs, pp.169–178

  ---

• Lara Pudwell and Rebecca Smith
  • Two-stack-sorting with pop stacks, pp.179–195

  ---

• Kazuhiro Suzuki
  • $(g,f)$-Chromatic spanning trees and forests , pp.196–209

  ---

• Jan-Hendrik de Wiljes
  • Weak king embeddings of oriented graphs, pp.210–215

  ---

• Part 2

  ---

• Markus Kuba and Alois Panholzer
  • Stirling permutations containing a single pattern of length three, pp.216–239

  ---

• Tomáš Madaras and Martina Tamášová
  • Minimal unavoidable sets of cycles in plane graphs with restricted minimum degree and edge weight, pp.240–252

  ---

• Tri Lai
  • Enumeration of hybrid domino-lozenge tilings III: centrally symmetric tilings, pp.253–287

  ---

• M. D. Francis, C. M. Mynhardt and J. L. Wodlinger
  • Subgraph-avoiding minimum decycling sets and $k$-conversion sets in graphs, pp.288–304

  ---

• Seth Chaiken, Christopher R. H. Hanusa and Thomas Zaslavsky
  • A $q$-queens problem III. Nonattacking partial queens, pp.305–331

  ---

• Maurizio Brunetti, Matteo Cavaleri and Alfredo Donno
  • A lexicographic product for signed graphs, pp.332–343

  ---

• Adam Mammoliti
  • The $r$-matching sequencibility of complete multi-$k$-partite $k$-graphs, pp.344–363

  ---

• Ira M. Gessel
  • Reciprocals of exponential polynomials and permutation enumeration, pp.364–370

  ---

• Part 3

  ---

• Oliver Krüger
  • An invariant for minimum triangle-free graphs, pp.371–388

  ---

• Kassie Archer, Adam Gregory, Bryan Pennington and Stephanie Slayden
  • Pattern restricted quasi-Stirling permutations, pp.389–407

  ---

• Ouail Kitouni and Nathan Reff
  • Lower bounds for the Laplacian spectral radius of an oriented hypergraph, pp.408–422

  ---

• Justin M. Troyka
  • On the centrosymmetric permutations in a class, pp.423–442

  ---

• S.A. Tapadia, Y.M. Borse and B.N.Waphare
  • Cycle decompositions of the Cartesian product of cycles, pp.443–459

  ---

• Majid Hajian, Nader Jafari Rad and Lutz Volkmann
  • Bounds on the fair total domination number in trees and unicyclic graphs, pp.460–475

  ---

• Mark Budden and Elijah DeJonge
  • Destroying the Ramsey property by the removal of edges, pp.476–485

  ---

• Neal Bushaw and Daniel W. Cranston
  • A note on bootstrap percolation thresholds in plane tilings using regular polygons, pp.486–497

  ---

• Donald L. Kreher and Douglas R. Stinson
  • Block-avoiding sequencings of points in Steiner triple systems, pp.498–509

  ---