The Australasian Journal of Combinatorics

Volume 73 (2019)

• Part 1

  ---

• Roland Lortz and Ingrid Mengersen
  • On the Ramsey number for stars versus connected graphs of order six, pp.1–24

  ---

• José L. Figueroa and Gilberto Calvillo
  • About the structure of the blocker of the hyperplanes of a matroid, pp.25–41

  ---

• Julian Allagan, Benkam Bobga, Mathew Cropper, Anthony Hilton, Peter Johnson,
  Jenö Lehel and Douglas Leonard
  • Refinements of Hall's condition, pp.42–70

  ---

• Jeremy Aikin and Adam Bland
  • Monochromatic sinks in 3-switched tournaments, pp.71–83

  ---

• John Lorch
  • Pandiagonal type-$p$ Franklin squares, pp.84–106

  ---

• R.S. Manikandan, P. Paulraja and T. Sivakaran
  • $p^2$-cycle decompositions of the tensor product of complete graphs, pp.107–131

  ---

• Anthony Mendes
  • The combinatorics of rim hook tableaux, pp.132–148

  ---

• Dean Crnković, Vedrana Mikulić Crnković and Andrea Švob
  • Block designs and strongly regular graphs admitting a transitive action of the Mathieu group $M_{11}$, pp.149–161

  ---

• Daniel Heinlein, Thomas Honold, Michael Kiermaier and Sascha Kurz
  • Generalized vector space partitions, pp.162–178

  ---

• Anthony B. Evans
  • Maximal partial transversals in a class of Latin squares, pp.179–199

  ---

• Nastaran Haghparast, Mikio Kano, Shunichi Maezawa and Kenta Ozeki
  • Connected odd factors of graphs, pp.200–206

  ---

• Santiago Barrera Acevedo and Heiko Dietrich
  • New infinite families of Williamson Hadamard matrices, pp.207–219

  ---

• S. Ganesamurthy and P. Paulraja
  • Decompositions of complete tripartite graphs into cycles of lengths $3$ and $6$, pp.220–241

  ---

• Amy Glen, Jamie Simpson and W.F. Smyth
  • Palindromes in starlike trees, pp.242–246

  ---

• Peter Borg and Kurt Fenech
  • Reducing the maximum degree of a graph by deleting edges, pp.247–260

  ---

• Part 2

  ---

• Andrea Vietri
  • On the graceful polynomials of a graph, pp.261–273

  ---

• A. Mohammed Abid and T.R. Ramesh Rao
  • Dominator coloring of Mycielskian graphs, pp.274–279

  ---

• Nader Jafari Rad
  • Upper bounds on the $k$-tuple domination number and $k$-tuple total domination number of a graph, pp.280–290

  ---

• I. Beaton and J.I. Brown
  • The domination equivalence classes of paths, pp.291–312

  ---

• S. Alikhani, D. Fatehi and C.M. Mynhardt
  • On $k$-total dominating graphs, pp.313–333

  ---

• César Hernández-Cruz, Magdalena Lemańska and Rita Zuazua
  • A characterization of trees having a minimum vertex cover which is also a minimum total dominating set, pp.334–345

  ---

• Tsz Lung Chan
  • Contractible and non-contractible non-edges in 2-connected graphs, pp.346–356

  ---

• Jessica De Silva, Xiang Si, Michael Tait, Yunus Tunçbilek, Ruifan Yang and Michael Young
  • Anti-Ramsey multiplicities, pp.357–371

  ---

• Richard A. Brualdi and Seth A. Meyer
  • The Gale-Ryser theorem modulo $k$, pp.372–384

  ---

• Michael Fuchs, Bernhard Gittenberger and Marefatollah Mansouri
  • Counting phylogenetic networks with few reticulation vertices: tree-child and normal networks, pp.385–423

  ---

• Part 3

  ---

• Do Trong Hoang and Tran Nam Trung
  • Coverings, matchings and the number of maximal independent sets of graphs, pp.424–431

  ---

• P. Katerinis
  • Fractional $\ell$-factors in regular graphs, pp.432–439

  ---

• Michael Albert and Jinge Li
  • Wilf-collapse in permutation classes having two basis elements of size three, pp.440–455

  ---

• J.A. Makowsky and R.X. Zhang
  • On $P$-unique hypergraphs, pp.456–465

  ---

• M. Hashemipour, M.R. Hooshmandasl and A. Shakiba
  • On the complexity of the outer-connected bondage and the outer-connected reinforcement problems, pp.466–477

  ---

• Edward Early
  • Order ideals in a product of chains , pp.478–485

  ---

• Hunter Rehm, Alex Schulte and Nathan Warnberg
  • Anti-van der Waerden numbers of graph products, pp.486–500

  ---

• Ronan Egan, Padraig Ó Catháin and Eric Swartz
  • Spectra of Hadamard matrices, pp.501–512

  ---