The Australasian Journal of Combinatorics

Volume 66 (2016)

• Part 1

  ---

• Andreas Dress, Katharina T. Huber, Jacobus Koolen, Vincent Moulton and Andreas Spillner
  • Characterizing block graphs in terms of their vertex-induced partitions, pp.1–9

  ---

• Masaaki Harada and Sho Suda
  • On binary codes related to mutually quasi-unbiased weighing matrices, pp.10–22

  ---

• Thomas A. McCourt and Justin Z. Schroeder
  • Self-embeddings of doubled affine Steiner triple systems, pp.23–43

  ---

• Jeremy F. Alm and Jacob Manske
  • The vector graph and the chromatic number of the plane, or how NOT to prove that $\chi(E^2)>4$, pp.44–49

  ---

• Zhongyuan Che and Zhibo Chen
  • Minimum order of $r$-regular bipartite graphs of pair length $k$, pp.50–65

  ---

• John M. Campbell
  • Bipieri tableaux, pp.66–103

  ---

• Margaret Archibald, Aubrey Blecher, Charlotte Brennan, Arnold Knopfmacher and Toufik Mansour
  • Partitions according to multiplicities and part sizes, pp.104–119

  ---

• Y.M. Borse, A.V. Sonawane and S.R. Shaikh
  • Connected bipancyclic isomorphic $m$-factorizations of the Cartesian product of graphs, pp.120–129

  ---

• M. J. Grannell and G. J. Lovegrove
  • Identical twin Steiner triple systems, pp.130–141

  ---

• Part 2

  ---

• Emilio Pierro
  • The Mobius function of the small Ree groups, pp.142–176

  ---

• Cayla D. McBee and Tim Penttila
  • Remarks on Hadamard conjugation and combinatorial phylogenetics, pp.177–191

  ---

• Isaac B. Michael and Mark R. Sepanski
  • Net regular signed trees, pp.192–204

  ---

• William M. Kantor
  • Cyclic elliptic spreads, pp.205–210

  ---

• Zhicheng Gao, Brendan D. McKay, Reza Naserasr and Brett Stevens
  • Bipartite edge partitions and the former Alon-Saks-Seymour conjecture, pp.211–228

  ---

• R. Lakshmi and S. Vidhyapriya
  • Kernels in Cartesian products of digraphs, pp.229–239

  ---

• Zoltán Lóránt Nagy
  • Density version of the Ramsey problem and the directed Ramsey problem, pp.240–255

  ---

• Gábor Hegedűs
  • A generalization of the Erdős-Ko-Rado Theorem, pp.256–264

  ---

• Peter Borg
  • Intersecting integer partitions, pp.265–275

  ---

• Kenneth J. Dykema
  • Generating functions for purely crossing partitions, pp.276–287

  ---

• D.A. Mojdeh, M. Alishahi and M. Chellali
  • Trees with the same global domination number as their square, pp.288–309

  ---

• Daouya Laïche, Isma Bouchemakh and Éric Sopena
  • On the packing coloring of undirected and oriented generalized theta graphs, pp.310–329

  ---

• Andries E. Brouwer, Supalak Sumalroj and Chalermpong Worawannotai
  • The nonexistence of distance-regular graphs with intersection arrays $\{27,20,10;1,2,18\}$ and $\{36,28,4;1,2,24\}$, pp.330–332

  ---

• Dinesh G. Sarvate and Li Zhang
  • Group divisible designs of three groups and block size five with configuration $(1,2,2)$, pp.333–343

  ---

• Elahe Sharifi and Nader Jafari Rad
  • A note on the independence number in bipartite graphs, pp.344–349

  ---

• Part 3

  ---

• Richard P. Brent, Judy-anne H. Osborn and Warren D. Smith
  • Probabilistic lower bounds on maximal determinants of binary matrices, pp.350–364

  ---

• P. Anusha Devi and S. Monikandan
  • Degree associated reconstruction number of connected digraphs with unique end vertex, pp.365–377

  ---

• Wannapol Pimpasalee and Keaitsuda Maneeruk Nakprasit
  • List backbone coloring of paths and cycles, pp.378–392

  ---

• Paola Bonacini, Mario Gionfriddo and Lucia Marino
  • Nonagon quadruple systems: existence, balance, embeddings, pp.393–406

  ---

• Nancy E. Clarke and Asiyeh Sanaei
  • Skolem labellings of generalised Dutch windmills, pp.407–419

  ---

• Nader Jafari Rad and Hadi Rahbani
  • A note on the locating-total domination in trees, pp.420–424

  ---

• Günter F. Steinke
  • On Kleinewillinghöfer types of finite Laguerre planes with respect to homotheties, pp.425–435

  ---

• Nawarat Ananchuen, Watcharaphong Ananchuen and Akira Saito
  • Extendability of the complementary prism of bipartite graphs, pp.436–448

  ---