The Australasian Journal of Combinatorics

Volume 5 (1992)

R.B. Eggleton, D.A. Holton and C.H.C. Little
- Cycles and paths in multigraphs, pp.3–11
Brendan D. McKay and Stanisław P. Radziszowski
- A new upper bound on the Ramsey number $R(5,5)$, pp.13–20
Mieko Yamada
- Generalized relative difference sets and PBIBDs associated with amorphous association schemes over an extension ring of $Z/4Z$, pp.21–42
Dwight R. Bean and Gernot M. Engel
- Satellite communications and multigraph edge-coloring, pp.43–52
Morimasa Tsuchiya
- On shifted intersecting families with respect to posets, pp.53–58
Elizabeth J. Billington and D.G. Hoffman
- Pairs of simple balanced ternary designs with prescribed numbers of triples in common, pp.59–71
L. Caccetta and Purwanto
- Deficiencies of connected regular triangle free graphs, pp.73–85
C.P. Bonnington and C.H.C. Little
- The classification of combinatorial surfaces using 3-graphs, pp.87–102
Peter Adams, Elizabeth J. Billington and C.C. Lindner
- The spectrum for 3-perfect 9-cycle systems, pp.103–108
D.H. Anderson and R. Brown
- Combinatorial aspects of C.A.R. Hoare's FIND algorithm, pp.109–119
D.G. Glynn and G.F. Steinke
- Groups of generalised projectivities in projective planes of odd order, pp.121–143
Rudolf Mathon and Dennis Lomas
- A census of 2-(9,3,3) designs, pp.145–158
E.S. Mahmoodian and M. Shirdarreh
- Some new families of simple $t$-designs, pp.159–168
B. Micale and M. Pennisi
- Constructions of simple Mendelsohn designs, pp.169–177
K. Budayasa, L. Caccetta and K. Vijayan
- The characterization of edge-maximal critically $k$-edge connected graphs, pp.179–207
J.R. Elliott and P.B. Gibbons
- The construction of subsquare free Latin squares by simulated annealing, pp.209–228
L. Caccetta and S. Mardiyono
- Premature sets of one-factors, pp.229–252
K.M. Koh and K.S. Poh
- On the spectrum of the closed-set lattice of a graph, pp.253–259
N.R. Achuthan and L. Caccetta
- Minimum weight spanning trees with bounded diameter, pp.261–276
M.D. Hendy
- The path sets of weighted partially labelled trees, pp.277–284
L.R. Foulds and Derek R. O'Connor
- Heuristics for sparse general travelling salesman problems, pp.285–292
Xiaoji Wang
- Asymptotic enumeration of Eulerian digraphs with multiple edges, pp.293–298
Wang Jian Zhong
- A sufficient condition for Hamiltonian cycles in bipartite tournaments, pp.299–304