The Australasian Journal of Combinatorics

Volume 48 (2010)

• Anne Penfold Street
  • Ralph Gordon Stanton, pp.3–4

  ---

• S.B. Rao, B.D. Acharya, T. Singh and Mukti Acharya
  • Hypergraceful complete graphs, pp.5–24

  ---

• Kim A.S. Factor and Larry J. Langley
  • Digraphs with isomorphic underlying and domination graphs: 4-cycles and pairs of paths, pp.25–41

  ---

• K.T. Arasu, I.S. Kotsireas, C. Koukouvinos and J. Seberry
  • On circulant and two-circulant weighing matrices, pp.43–51

  ---

• Andrew Hudson and Tim Penttila
  • A family of translation planes, pp.53–56

  ---

• Mark Ramras
  • Balanced independent sets in hypercubes, pp.57–72

  ---

• Włodzimierz Ulatowski
  • All graphs with restrained domination number three less than their order, pp.73–86

  ---

• David Auger, Irène Charon, Olivier Hudry and Antoine Lobstein
  • On the sizes of the graphs $G$, $G^r$, $G^r\setminus G$: the directed case, pp.87–109

  ---

• Jingyu Wang, Jianping Ou and Tiedan Zhu
  • On restricted edge connectivity of regular Cartesian product graphs, pp.111–115

  ---

• Yuri Yoshida and Tatsuya Maruta
  • An extension theorem for $[n,k,d]_d$ codes with gcd$(d,q)=2$, pp.117–131

  ---

• Harout Aydinian, Éva Czabarka, Konrad Engel, Péter L. Erdős and László A. Székely
  • A note on full transversals and mixed orthogonal arrays, pp.133–141

  ---

• Ian T. Roberts, Leanne J. Rylands, Terry Montag and Martin Grüttmüller
  • On the number of minimal completely separating systems and antichains in a Boolean lattice, pp.143–158

  ---

• Anders Claesson, Sergey Kitaev, Kári Ragnarsson and Bridget Eileen Tenner
  • Boolean complexes for Ferrers graphs, pp.159–173

  ---

• B. Chaluvaraju, M. Chellali and K.A. Vidya
  • Perfect $k$-domination in graphs, pp.175–184

  ---

• Araya Chaemchan
  • The edge domination number of connected graphs, pp.185–189

  ---

• Michael J. Ferrara, Michael S. Jacobson and Angela K. Harlan
  • Hamiltonian cycles avoiding sets of edges in a graph, pp.191–203

  ---

• Laura J. Culp and Richard H. Hammack
  • An isomorphism theorem for digraphs, pp.205–211

  ---

• Grant Cairns and Nhan Bao Ho
  • Ultimately bipartite subtraction games, pp.213–220

  ---

• Michael Giudici and Aedan Pope
  • The diameters of commuting graphs of linear groups and matrix rings over the integers modulo $m$, pp.221–230

  ---

• Mostafa Blidia and Lyes Ould-Rabah
  • Bounds on the domination number in oriented graphs, pp.231–241

  ---

• Judy-anne Osborn
  • Bi-banded paths, a bijection and the Narayana numbers, pp.243–252

  ---

• Csilla Bujtás and Zsolt Tuza
  • Voloshin's conjecture for C-perfect hypertrees, pp.253–267

  ---

• Zhaohong Niu and Liming Xiong
  • Even factor of a graph with a bounded number of components, pp.269–279

  ---

• Lakoa Fitina, C.T. Lenard and T.M. Mills
  • A note on the connectivity of the Cartesian product of graphs, pp.281–284

  ---

• Soufiane Khelifi, Mostafa Blidia, Mustapha Chellali and Frédéric Maffray
  • Double domination edge removal critical graphs, pp.285–299

  ---