The Australasian Journal of Combinatorics

Volume 45 (2009)

• Oudone Phanalasy, Ian T. Roberts and Leanne J. Rylands
  • Covering separating systems and an application to search theory, pp.3–14

  ---

• S.A. Choudum and S. Lavanya
  • Complete $k$-ary trees and Hamming graphs, pp.15–24

  ---

• Víctor Neumann-Lara and Mika Olsen
  • Enumeration and dichromatic number of tame tournaments, pp.25–35

  ---

• M.R. Pournaki
  • On the number of even permutations with roots, pp.37–42

  ---

• Vincent E. Castellana and D.G. Hoffman
  • On the spectrum of minimal covers by triples, pp.43–58

  ---

• Amy N. Myers
  • Forbidden substrings on weighted alphabets, pp.59–65

  ---

• S. Akbari, M. Jamaali, A. Mahmoody and S.A. Seyed Fakhari
  • On the size of graphs whose cycles have length divisible by a fixed integer, pp.67–72

  ---

• Atsuhiro Nakamoto and Norihito Sasanuma
  • Chromatic numbers of 6-regular graphs on the Klein bottle, pp.73–85

  ---

• Mustapha Chellali, Teresa W. Haynes and Lutz Volkmann
  • Global offensive alliance numbers in graphs with emphasis on trees, pp.87–96

  ---

• Martin Knor
  • Unicyclic radially-maximal graphs on the minimum number of vertices, pp.97–107

  ---

• Tomasz Dzido and Renata Zakrewska
  • The nonclassical mixed domination Ramsey numbers, pp.109–115

  ---

• Lars-Daniel Öhman
  • A note on completing latin squares, pp.117–123

  ---

• Benjamin R. Smith
  • Complete equipartite $3p$-cycle systems, pp.125–138

  ---

• W.C. Shiu and Harris Kwong
  • An algebraic approach for finding balance index sets, pp.139–155

  ---

• D.A. Preece
  • Daisy chains with three generators, pp.157–174

  ---

• David Rivshin and Stanisław P. Radziszowski
  • The vertex and edge graph reconstruction numbers of small graphs, pp.175–188

  ---

• I.D. Gray and J.A. MacDougall
  • Vertex-magic labelings: mutations, pp.189–206

  ---

• Lutz Volkmann
  • On regular $(1,q)$-extendable graphs, pp.207–215

  ---

• Vladimir Samodivkin
  • Domination with respect to nondegenerate properties: bondage number, pp.217–226

  ---

• Mustapha Chellali and Nader Jafari Rad
  • Locating-total domination critical graphs, pp.227–234

  ---

• William F. Klostermeyer and C.M. Mynhardt
  • Edge protection in graphs, pp.235–250

  ---

• Darryn Bryant and Geoffrey Martin
  • Some results on decompositions of low degree circulant graphs, pp.251–261

  ---

• John McCabe and Kathryn Weld
  • On an inverse Cayley problem, pp.263–276

  ---

• Johannes H. Hattingh, Elizabeth Jonck and Charl J. Ras
  • A class of full $(d,1)$-colorable trees, pp.277–289

  ---

• Mariusz Meszka and Alexander Rosa
  • Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles, pp.291–302

  ---

• Robert A. Beeler, Robert E. Jamison and Eric Mendelsohn
  • The 2-star spectrum of stars, pp.303–308

  ---

• W.C. Shiu and Richard M. Low
  • ${\Bbb Z}_k$-magic labellings of fans and wheels with magic value zero, pp.309–316

  ---