The Australasian Journal of Combinatorics

Volume 60 (2014)

• Part 1

  ---

• Mark Ramras
  • Congestion-free routing of linear permutations on Fibonacci and Lucas cubes, pp.1–10

  ---

• Gary MacGillivray and Kailyn M. Sherk
  • A theory of 2-dipath colourings, pp.11–26

  ---

• Derrick Stolee
  • Automorphism groups and adversarial vertex deletions, pp.27–34

  ---

• Caroline Shapcott
  • An introduction to true palindromic compositions, pp.35–49

  ---

• P. Ali, S. Mukwembi and S. Munyira
  • Degree distance and edge-connectivity, pp.50–68

  ---

• Peter Borg
  • The maximum product of sizes of cross-$t$-intersecting uniform families, pp.69–78

  ---

• Sarada Herke
  • On the perfect 1-factorisation problem for circulant graphs of degree 4, pp.79–108

  ---

• Part 2

  ---

• Roland Bacher
  • Prüfer codes for acyclic hypertrees, pp.109–127

  ---

• Patrick Bahls, Elizabeth Bailey and McCabe Olsen
  • New families of graphs whose independence polynomials have only real roots, pp.128–135

  ---

• J. Louis Sewell and Peter J. Slater
  • A sharp lower bound for locating-dominating sets in trees, pp.136–149

  ---

• Tatsuya Maruta, Taichiro Tanaka and Hitoshi Kanda
  • Some generalizations of extension theorems for linear codes over finite fields, pp.150–157

  ---

• Ruixia Wang
  • Cycles in 3-anti-circulant digraphs, pp.158–168

  ---

• K. Asciak, J. Lauri, W. Myrvold and V. Pannone
  • On the edge-reconstruction number of a tree, pp.169–190

  ---

• James A. Sellers
  • Elementary proofs of congruences for the cubic and overcubic partition functions, pp.191–197

  ---

• Alessandro Conflitti, Ricardo Mamede and Eleni Tzanaki
  • Dominant Shi regions with a fixed separating wall: bijective enumeration, pp.198–207

  ---

• Antonio Cossidente and Angelo Sonnino
  • On graphs and codes associated to the sporadic simple groups HS and $M_{22}$, pp.208–216

  ---

• Grant Cairns, Stacey Mendan and Yuri Nikolayevsky
  • A sharp refinement of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences, pp.217–226

  ---

• Darryn Bryant, Sarada Herke, Barbara Maenhaut and Wannasiri Wannasit
  • Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs, pp.227–254

  ---

• Part 3

  ---

• Udaya Parampalli and Serdar Boztaş
  • A class of quaternary noncyclic Hadamard matrices, pp.255–262

  ---

• P. Katerinis
  • Minimum degree and the existence of semiregular factors in planar graphs, pp.263–269

  ---

• Jeremy F. Alm and Jacob Manske
  • On radial colorings of annuli, pp.270–278

  ---

• Matthieu Josuat-Vergès
  • Enumeration of snakes and cycle-alternating permutations, pp.279–305

  ---

• Xueliang Li, Yuefang Sun and Yan Zhao
  • Characterize graphs with rainbow connection numbers $m-2$ and $m-3$, pp.306–313

  ---

• Lowell Abrams and Yosef Berman
  • Connected pseudoachromatic index of complete graphs, pp.314–324

  ---

• Mario Gionfriddo and Salvatore Milici
  • Uniformly resolvable ${\cal H}$-designs with ${\cal H}=\{P_3,P_4\}$, pp.325–332

  ---

• Richard A. Brualdi and Hwa Kyung Kim
  • Symmetric alternating sign matrices, pp.333–345

  ---