Australasian Journal of Combinatorics

Contents Volume 11:

R.E.L. Aldred and Robert L. Hemminger, On Hamilton cycles and contractible edges in 3-connected graphs, p.3

Vitaly I. Voloshin, On the upper chromatic number of a hypergraph, p.25

Karl H. Wehrhahn, Applications of Narayana's formula, p.47

Nasrin Soltankhah, On directed trades, p.59

D.L. Flannery, Transgression and the calculation of cocyclic matrices, p.67

P.B. Gibbons and R. Mathon, Signings of group divisible designs and projective planes, p.79

J.H. Dinitz and W.J. Martin, The stipulation polynomial of a uniquely list-colorable graph, p.105

Zhicheng Gao, R. Bruce Richter and Xingxing Yu, 2-walks in 3-connected planar graphs, p.117

A. Baliga and K.J. Horadam, Cocyclic Hadamard matrices over {\bf Z}${}_t\times{}${\bf Z}${}_2^2$, p.123

Noboru Ito, Note on Hadamard groups and difference sets, p.135

Marston Conder and Margaret Morton, Classification of trivalent symmetric graphs of small order, p.139

Heiko Harborth, Ingrid Mengersen and Richard H. Schelp, The drawing Ramsey number $Dr(K_n)$, p.151

Guantao Chen, Lisa R. Marcus and R.H. Schelp, Vertex disjoint cycles for star free graphs, p.157

Yabao Guo and Lutz Volkmann, Tree-Ramsey numbers, p.169

D.G. Sarvate, Note on parameters of balanced ternary designs, p.177

G. Ge and L. Zhu, Existence of almost resolvable directed 5-cycle systems, p.181

Peter Adams, Darryn E. Bryant and Saad I. El-Zanati, Lambda-fold cube decompositions, p.197

B. Du, On complementary path decompositions of the complete multigraph, p.211

D.A. Holton, Dinjun Lou and K.L. McAvaney, $n$-extendability of line graphs, power graphs, and total graphs, p.215

Cheng Szu-En, Matrix constructions of family$\,$(A) group divisible designs, p.223

J.L. Ram\'\i rez-Alfons\'\i n, Cycle decompositions of complete and complete multipartite graphs, p.233

R.G. Stanton, A study of hendecads, p.239

R.L. Constable, D.A. Preece, N. Phillips, T.D. Porter and W.D. Wallis, Single change neighbor designs, p.247

G. Li, B. Wei and T. Gao, A structural method for Hamiltonian graphs, p.257

C.C. Chen and T.A. Peng, Classroom note: Almost-isosceles right-angled triangles, p.263