The Australasian Journal of Combinatorics

Volume 33 (2005)

• Elias Dahlhaus, Paul D. Manuel and Mirka Miller
  • Parallel algorithms for generalized clique transversal problems, pp.3–14

  ---

• Izak Broere, Elizabeth Jonck, Gayla S. Domke and Lisa R. Markus
  • The induced path number of the complements of some graphs, pp.15–32

  ---

• M.H. Albert, R.E.L. Aldred, M.D. Atkinson, H.P. van Ditmarsch and C.C. Handley
  • Safe communication for card players by combinatorial designs for two-step protocols, pp.33–46

  ---

• Junling Zhou and Yanxun Chang
  • Product constructions for large sets of resolvable MTSs and DTSs, pp.47–56

  ---

• Ian T. Roberts and Leanne J. Rylands
  • Minimal $(n)$ and $(n,h,k)$ Completely Separating Systems, pp.57–66

  ---

• J. Wang
  • Existence of 2-perfect GD6CSs, pp.67–76

  ---

• Sarita Rudra, Shakti Banerjee and Sanpei Kageyama
  • Constructions of 3-resolvable nested 3-designs and 3-wise balanced designs, pp.77–86

  ---

• Ian T. Roberts
  • Completely separating systems of $k$-sets for $7 \leq k \leq 10$, pp.87–98

  ---

• Christian Barrientos
  • Graceful graphs with pendant edges, pp.99–107

  ---

• Rita SahaRay, Avishek Adhikari and Jennifer Seberry
  • Critical sets in orthogonal arrays with 7 and 9 levels, pp.109–123

  ---

• A. Cossidente and A. Siciliano
  • On the largest minimal blocking set in PG$({\mathbb {F}_8})$, pp.125–128

  ---

• Jian Wang
  • $P_7$-factorization of complete bipartite graphs, pp.129–137

  ---

• Qin Chengfu, Yuan Xudong and Su Jianji
  • Triangles in contraction critical 5-connected graphs, pp.139–146

  ---

• Yejing Wang, Jennifer Seberry, Beata J. Wysocki, Tadeusz A. Wysocki, Le Chung Tran, Ying Zhao and Tianbing Xia
  • An exposure property of block designs, pp.147–156

  ---

• Yuejian Peng and Cheng Zhao
  • On incomparable and uncomplemented families of sets, pp.157–168

  ---

• Dalibor Fronček, Petr Kovář and Tereza Kovářová
  • Vertex magic total labeling of products of cycles, pp.169–181

  ---

• Antonio Pasini
  • A tower of geometries related to the ternary Golay codes, pp.183–216

  ---

• Martin Hessler
  • A computer study of some 1-error correcting perfect binary codes, pp.217–229

  ---

• Dimitri Leemans
  • The residually weakly primitive geometries of $\sf HS$, pp.231–236

  ---

• D.A. Preece, W.D. Wallis and J.L. Yucas
  • Paley triple arrays, pp.237–246

  ---

• Lucia Gionfriddo and C.C. Lindner
  • Nesting kite and 4-cycle systems, pp.247–254

  ---

• Ju Zhou and Jinjiang Yuan
  • Characterization of induced matching extendable graphs with $2n$ vertices and $3n-1$ edges, pp.255–263

  ---

• Angelika Hellwig and Lutz Volkmann
  • Neighborhood conditions for graphs and digraphs to be maximally edge-connected, pp.265–277

  ---

• W. Duckworth
  • Total domination of random regular graphs, pp.279–289

  ---

• Y. Bani Hammad, G. Carter, E. Dawson, W. Müller and Y. Hitchcock
  • RAK factoring algorithm, pp.291–305

  ---

• Michel Lavrauw and Maska Law
  • BLT-sets admitting the symmetric group $S_4$, pp.307–316

  ---

• Mostafa Blidia, Mustapha Chellali and Odile Favaron
  • Independence and $2$-domination in trees, pp.317–327

  ---

• Hong Wang
  • On large cycles with lengths differing by one or two, pp.329–333

  ---

• Angelo Sonnino
  • Transitive hyperovals in finite projective planes, pp.335–347

  ---