The Australasian Journal of Combinatorics

Volume 56 (2013)

• C.M. Mynhardt and J. Wodlinger
  • A class of trees with equal broadcast and domination numbers, pp.3–22

  ---

• Jaromy Kuhl and Michael W. Schroeder
  • Hamilton cycle decompositions of $k$-uniform $k$-partite hypergraphs, pp.23–37

  ---

• Dorota Bród
  • On $H$-dominating matchings and some number partitions, pp.39–46

  ---

• Sarah Spence Adams, Zachary Brass, Connor Stokes and Denise Sakai Troxell
  • Irreversible $k$-threshold and majority conversion processes on complete multipartite graphs and graph products, pp.47–60

  ---

• V. Andova, M. Knor, P. Potočnik and R. Škrekovski
  • On a variation of the Randíc index, pp.61–75

  ---

• Ben Babcock and Adam Van Tuyl
  • Revisiting the spread and covering numbers, pp.77–84

  ---

• Mustapha Chellali and Nader Jafari Rad
  • On 2-rainbow domination and Roman domination in graphs, pp.85–93

  ---

• Yancai Zhao, Erfang Shan and H. Abdollahzadeh Ahangar
  • Signed total domination on Kronecker products of two complete graphs, pp.95–102

  ---

• Ahmed Bouchou and Mostafa Blidia
  • Criticality indices of Roman domination of paths and cycles, pp.103–112

  ---

• I. Beaton, R. Begin, S. Finbow and C.M. van Bommel
  • Even time constraints on the watchman's walk, pp.113–121

  ---

• Xiaoxia Zhang and Xiangwen Li
  • Group connectivity of semistrong product of graphs, pp.123–132

  ---

• Xun-Tuan Su, Deng-Yun Yang and Wei-Wei Zhang
  • A note on the generalized factorial, pp.133–137

  ---

• Hiroshi Nozaki
  • Lower bounds for the minimum diameter of integral point sets, pp.139–143

  ---

• Vahan V. Mkrtchyan
  • A remark on the Petersen coloring conjecture of Jaeger, pp.145–151

  ---

• Qian Huang and Jian-yi Shi
  • The left cells with $a$-values 5, 6 in the affine Weyl group $\tilde{E_8}$, pp.153–182

  ---

• Vladimir Samodivkin
  • Note on the bondage number of graphs on topological surfaces, pp.183–186

  ---

• Peter J. Cameron
  • Groups with right-invariant multiorders, pp.187–193

  ---

• Salvatore Milici
  • A note on uniformly resolvable decompositions of $K_v$ and $K_v-I$ into 2-stars and 4-cycles, pp.195–200

  ---

• Ryan C. Bunge, Saad I. El-Zanati, Chepina Rumsey and Charles Vanden Eynden
  • On the cyclic decomposition of circulant graphs into bipartite graphs, pp.201–217

  ---

• Midori Kobayashi, Brendan D. McKay, Nobuaki Mutoh, Gisaku Nakamura and Chie Nara
  • 3-Perfect hamiltonian decomposition of the complete graph, pp.219–224

  ---

• Søren Bøg, Morten Stöckel and Hjalte Wedel Vildhøj
  • The hardness of the functional orientation 2-color problem, pp.225–234

  ---

• Charles C. Lindner, Mariusz Meszka and Alexander Rosa
  • Palettes in block colourings of designs, pp.235–243

  ---

• S. Bonvicini and G. Mazzuoccolo
  • Covering cubic graphs with matchings of large size, pp.245–255

  ---

• S. Rahmawati, K.A. Sugeng, D.R. Silaban, M. Miller and M. Bača
  • Construction of new larger $(a,d)$-edge antimagic vertex graphs by using adjacency matrices, pp.257–272

  ---