The Australasian Journal of Combinatorics

Volume 29 (2004)

• Anton Betten
  • Genealogy of $t$-designs, pp.3–34

  ---

• Danhong Zhang and Hong Wang
  • A minimum degree result for disjoint cycles and forests in bipartite graphs, pp.35–47

  ---

• Stefan Winzen
  • Strong subtournaments of close to regular multipartite tournaments, pp.49–57

  ---

• Elaine M. Eschen and Jianbing Niu
  • On potentially $(K_4-e)$-graphic sequences, pp.59–65

  ---

• E. Boudreau, B. Hartnell, K. Schmeisser and J. Whiteley
  • A game based on vertex-magic total labelings, pp.67–73

  ---

• A.D. Forbes, M.J. Grannell and T.S. Griggs
  • Configurations and trades in Steiner triple systems, pp.75–84

  ---

• Min Ho Lee
  • Exterior derivatives and Laplacians on digraphs, pp.85–94

  ---

• Dingjun Lou and Huiquan Zhu
  • A note on max-leaves spanning tree problem in Halin graphs, pp.95–97

  ---

• Duncan Campbell and Keith Edwards
  • A new lower bound for the harmonious chromatic number, pp.99–102

  ---

• Toufik Mansour
  • Restricted $132$-Dumont permutations, pp.103–117

  ---

• Lutz Volkmann
  • On the size of odd order graphs with no almost perfect matching, pp.119–126

  ---

• Dingjun Lou and Qinglin Yu
  • Sufficient conditions for $n$-matchable graphs, pp.127–133

  ---

• Zemin Jin and Xueliang Li
  • On a conjecture on $k$-walks of graphs, pp.135–142

  ---

• Laura Harris and Johannes H. Hattingh
  • The algorithmic complexity of certain functional variations of total domination in graphs, pp.143–156

  ---

• K.B. Reid, A.A. McRae, S.M. Hedetniemi and S.T. Hedetniemi
  • Domination and irredundance in tournaments, pp.157–172

  ---

• Abdollah Khodkar, M.A. Shahabi and S.M. Sheikholeslami
  • Families of 2-critical sets for dihedral groups, pp.173–186

  ---

• Sergey Kitaev
  • The sigma-sequence and counting occurrences of some patterns, subsequences and subwords, pp.187–200

  ---

• Michael U. Gerber and Daniel Kobler
  • Classes of graphs that can be partitioned to satisfy all their vertices, pp.201–214

  ---

• R.E.L. Aldred and Michael D. Plummer
  • Edge proximity and matching extension in planar triangulations, pp.215–224

  ---

• D.G. Hoffman and C.C. Lindner
  • A partial $K_4-e$-design of order $n$ can be embedded in a $K_4-e$-design of order at most $8n+16\sqrt{n}+82$, pp.225–230

  ---

• L. Burnett, W. Millan, E. Dawson and A. Clark
  • Simpler methods for generating better Boolean functions with good cryptographic properties, pp.231–247

  ---

• Atsuhiro Nakamoto
  • Four-regular graphs that quadrangulate both the torus and the Klein bottle, pp.249–257

  ---

• D. Combe, A.M. Nelson and W.D. Palmer
  • Magic labellings of graphs over finite abelian groups, pp.259–271

  ---

• Henning Fernau
  • Complexity of a $\{0,1\}$-matrix problem, pp.273–300

  ---

• R.J.R. Abel, D. Combe and W.D. Palmer
  • Bhaskar Rao designs and the groups of order 12, pp.301–308

  ---

• Christian Sloper
  • An eccentric coloring of trees, pp.309–321

  ---

• Diane Donovan, Saad I. El-Zanati, Charles Vanden Eynden and Somporn Sutinuntopas
  • Labelings of unions of up to four uniform cycles, pp.323–336

  ---

• Kishore Sinha, Sanpei Kageyama, Ashish Das and G.M. Saha
  • Some series of block designs with nested rows and columns, pp.337–347

  ---