The Australasian Journal of Combinatorics

Volume 70 (2018)

• Part 1

  ---

• Xueliang Li and Yan Zhao
  • On extremal graphs with exactly one Steiner tree connecting any $k$ vertices, pp.1–11

  ---

• Slobodan Filipovski
  • A note on degree/diameter monotonicity of digraphs, pp.12–14

  ---

• Elia Saini
  • A new presentation for the inner Tutte group of a matroid, pp.15–27

  ---

• Yaping Mao
  • Constructing internally disjoint pendant Steiner trees in Cartesian product networks, pp.28–51

  ---

• A.D. Forbes and T.S. Griggs
  • Designs for graphs with six vertices and nine edges, pp.52–74

  ---

• Mohsen Aliabadi and Mano Vikash Janardhanan
  • On local matching property in groups and vector spaces, pp.75–85

  ---

• William J. Keith, Dalibor Froncek and Donald L. Kreher
  • A note on nearly platonic graphs, pp.86–103

  ---

• Catarina P. Avelino and Altino F. Santos
  • Geometric and combinatorial structure of a class of spherical folding tesselations - II, pp.104–122

  ---

• Mujiangshan Wang, Yuqing Lin, Shiying Wang and Meiyu Wang
  • Sufficient conditions for graphs to be maximally 4-restricted edge connected, pp.123–136

  ---

• Lin Chen, Xueliang Li, Henry Liu and Jinfeng Liu
  • On various (strong) rainbow connection numbers of graphs, pp.137–156

  ---

• Wai Chee Shiu and Richard M. Low
  • The integer-magic spectra and null sets of the Cartesian product of trees, pp.157–167

  ---

• Part 2

  ---

• Grace Misereh and Yuri Nikolayevsky
  • Thrackles containing a standard musquash, pp.168–184

  ---

• Agnese Baldisserri and Elena Rubei
  • Distance matrices of some positive-weighted graphs, pp.185–201

  ---

• Ji-Hwan Jung, István Mező and José L. Ramírez
  • The $r$-Bessel and restricted $r$-Bell numbers, pp.202–220

  ---

• Katherine F. Benson, Daniela Ferrero, Mary Flagg, Veronika Furst, Leslie Hogben, Violeta Vasilevska and Brian Wissman
  • Zero forcing and power domination for graph products, pp.221–235

  ---

• David Galvin and Justin Hilyard
  • The independent set sequence of some families of trees, pp.236–252

  ---

• Amir Barghi
  • Stirling numbers of the first kind for graphs, pp.253–268

  ---

• Mária Timková
  • Enforced hamiltonian cycles in circulant graphs, pp.269–278

  ---

• Akihiro Munemasa and Pritta Etriana Putri
  • A matrix approach to Yang multiplication theorem, pp.279–287

  ---

• Masaaki Harada and Ken Saito
  • Singly even self-dual codes constructed from Hadamard matrices of order 28, pp.288–296

  ---

• Part 3

  ---

• Johannes H. Hattingh and Ernst J. Joubert
  • The product of the total restrained domination numbers of a graph and its complement, pp.297–308

  ---

• Tsz Lung Chan
  • Covering contractible edges in 2-connected graphs, pp.309–318

  ---

• Bryan Freyberg and Melissa Keranen
  • Orientable $\mathbb{Z}_{n}$-distance magic graphs via products, pp.319–328

  ---

• Erik Thörnblad
  • Eplett's theorem for self-converse generalised tournaments, pp.329–335

  ---

• Yoshimi Egawa and Michitaka Furuya
  • On star-packings having a large matching, pp.336–339

  ---

• D. González-Moreno and R. Hernández Ortiz
  • A note on the restricted arc connectivity of oriented graphs of girth four, pp.340–348

  ---

• Guoliang Hao, Doost Ali Mojdeh, Shouliu Wei and Zhihong Xie
  • Rainbow domination in the Cartesian product of directed paths, pp.349–361

  ---

• Dursun A. Bulutoglu and Kenneth J. Ryan
  • Integer programming for classifying orthogonal arrays, pp.362–385

  ---

• Anthony D. Forbes, Terry S. Griggs and Kim A. Forbes
  • Completing the design spectra for graphs with six vertices and eight edges, pp.386–389

  ---

• Melody Bruce. Mark Budden and Josh Hiller
  • Lexicographic products of $r$-uniform hypergraphs and some applications to hypergraph Ramsey theory, pp.390–401

  ---

• Richard Ehrenborg and Alex Happ
  • Parking cars after a trailer, pp.402–406

  ---