The Australasian Journal of Combinatorics

Volume 32 (2005)

• Hung-Lin Fu
  • Balanced bipartite 4-cycle designs, pp.3–26

  ---

• Peter Pleasants, Harry Ray and Jamie Simpson
  • The Frobenius problem on lattices, pp.27–45

  ---

• Bill Calhoun, Kevin Ferland, Lisa Lister and John Polhill
  • Totally magic labelings of graphs, pp.47–59

  ---

• Mingyuan Xia, Tianbing Xia, Jennifer Seberry and Guoxin Zuo
  • A new method for constructing $T$-matrices, pp.61–78

  ---

• Shinya Fujita
  • Partition of a graph into cycles and isolated vertices, pp.79–89

  ---

• Lynne L. Doty and Kevin K. Ferland
  • Supertough graphs need not be $K_{1,3}$-free, pp.91–103

  ---

• Yoshimi Egawa and Masao Tsugaki
  • A bound on the order of a graph when both the graph and its complement are contraction-critically $k$-connected, pp.105–110

  ---

• S.A. Choudum and M.A. Shalu
  • The class of $\{3K_1, C_4\}$-free graphs, pp.111–116

  ---

• Weizhen Gu, Xingde Jia and Haidong Wu
  • Chords in graphs, pp.117–124

  ---

• Atif A. Abueida, Mike Daven and Kenneth J. Roblee
  • Multidesigns of the $\lambda$-fold complete graph for graph-pairs of orders 4 and 5, pp.125–136

  ---

• Mary Waterhouse
  • Some equitably 2 and 3-colourable cube decompositions, pp.137–145

  ---

• Narong Punnim
  • Decycling regular graphs, pp.147–162

  ---

• Thomas Lam
  • A result on $2k$-cycle-free bipartite graphs, pp.163–170

  ---

• Tsuyoshi Nishimura
  • Note on a closure concept and matching extension, pp.171–175

  ---

• Irène Charon, Olivier Hudry and Antoine Lobstein
  • Possible cardinalities for identifying codes in graphs, pp.177–195

  ---

• Yan Zhang and Beiliang Du
  • The existence of resolvable Mendelsohn designs RMD$(\{3,s^*\},v)$, pp.197–204

  ---

• G. Sethuraman and A. Elumalai
  • Gracefulness of a cycle with parallel $P_k$-chords, pp.205–211

  ---

• K.T. Arasu and Surinder Sehgal
  • Cyclic difference covers, pp.213–223

  ---

• R.M. Figueroa-Centeno, R. Ichishima and F.A. Muntaner-Batle
  • On edge-magic labelings of certain disjoint unions of graphs, pp.225–242

  ---

• Ashish Das, Aloke Dey, Sanpei Kageyama and Kishore Sinha
  • $A$-efficient balanced treatment incomplete block designs, pp.243–252

  ---

• Mukul Subodh Bansal and V.Ch. Venkaiah
  • A note on finding a maximum clique in a graph using BDDs, pp.253–257

  ---

• Ngo Dac Tan and Tran Minh Tuoc
  • An algorithm for determining connectedness of tetravalent metacirculant graphs, pp.259–277

  ---

• Igor' É. Zverovich and Inessa I. Zverovich
  • Ratio of generalized stability and domination parameters, pp.279–284

  ---

• Nicholas Cavenagh, Diane Donovan and Aleš Drápal
  • 4-homogeneous latin trades, pp.285–303

  ---

• M.M.M. Jaradat and Maref Y. Alzoubi
  • An upper bound of the basis number of the lexicographic product of graphs, pp.305–312

  ---

• M. Arian-Nejad and M. Emami
  • Notes on the structure of support in BIB designs, pp.313–322

  ---

• Elizabeth J. Billington, C.C. Lindner and A. Rosa
  • Lambda-fold complete graph decompositions into perfect four-triple configurations, pp.323–330

  ---

• E.S. Yazici
  • Metamorphosis of 2-fold 4-cycle systems into maximum packings of 2-fold 6-cycle systems, pp.331–338

  ---

• W.D. Wallis and R.A. Yates
  • On totally magic injections, pp.339–348

  ---