Australasian Journal of Combinatorics

Previous Volume 28 - Next Volume 30

• Author Search (all volumes)
• Keyword Search (all volumes: titles)

Contents Volume 29:

Anton Betten, Genealogy of $t$-designs, p.3

Danhong Zhang and Hong Wang, A minimum degree result for disjoint cycles and forests in bipartite graphs, p.35

Stefan Winzen, Strong subtournaments of close to regular multipartite tournaments, p.49

Elaine~M. Eschen and Jianbing Niu, On potentially $(K_4-e)$-graphic sequences, p.59

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

A.D. Forbes, M.J. Grannell and T.S. Griggs, Configurations and trades in Steiner triple systems, p.75

Min~Ho Lee, Exterior derivatives and Laplacians on digraphs, p.85

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

Duncan Campbell and Keith Edwards, A new lower bound for the harmonious chromatic number, p.99

Toufik Mansour, Restricted $132$-Dumont permutations, p.103

Lutz Volkmann, On the size of odd order graphs with no almost perfect matching, p.119

Dingjun Lou and Qinglin Yu, Sufficient conditions for $n$-matchable graphs, p.127

Zemin Jin and Xueliang Li, On a conjecture on $k$-walks of graphs, p.135

Laura Harris and Johannes~H. Hattingh, The algorithmic complexity of certain functional variations of total domination in graphs, p.143

K.B. Reid, A.A. McRae, S.M. Hedetniemi and S.T. Hedetniemi, Domination and irredundance in tournaments, p.157

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

Sergey Kitaev, The sigma-sequence and counting occurrences of some patterns, subsequences and subwords, p.187

Michael~U. Gerber and Daniel Kobler, Classes of graphs that can be partitioned to satisfy all their vertices, p.201

R.E.L. Aldred and Michael~D. Plummer, Edge proximity and matching extension in planar triangulations, p.215

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$, p.225

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

Atsuhiro Nakamoto, Four-regular graphs that quadrangulate both the torus and the Klein bottle, p.249

D. Combe, A.M. Nelson and W.D. Palmer, Magic labellings of graphs over finite abelian groups, p.259

Henning Fernau, Complexity of a $\{0,1\}$-matrix problem, p.273

R.J.R. Abel, D. Combe and W.D. Palmer, Bhaskar Rao designs and the groups of order 12, p.301

Christian Sloper, An eccentric coloring of trees, p.309

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

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