CMSA LogoAustralasian Journal of Combinatorics

AJC Main page

Previous Volume 12 - Next Volume 14

Contents Volume 13:

R.E.L. Aldred, Chen Jian and Robert L. Hemminger, The 3-connected graphs with a longest path containing precisely two contractible edges, p.3

D.W. Cribb, J.W. Boland and R.D. Ringeisen, Stability of $i$-connectivity parameters under edge addition, p.15

Ahmad M. Assaf, On packing designs with block size 5 and indices 3 and 5, p.23

Mingyao Xu and Jixiang Meng, Weakly $3-DCI$ abelian groups, p.49

Dalibor Fron\v cek, Decompositions of complete multipartite graphs into selfcomplementary factors with finite diameters, p.61

Ed Dawson, Diane Donovan and Alan Offer, Quasigroups, isotopisms and authentication schemes, p.75

R. Craigen and H. Kharaghani, A combined approach to the construction of Hadamard matrices, p.89

R.S. Booth and J.F. Weng, Steiner minimal trees on the union of two orthogonal rectangles, p.109

Martin Harborth and Ingrid Mengersen, Some Ramsey numbers for complete bipartite graphs, p.119

Colin Ramsay and Ian T. Roberts, Minimal completely separating systems of sets, p.129

Arnold Knopfmacher and Richard Warlimont, Counting permutations and polynomials with a restricted factorization pattern, p.151

M.I. Porteous and R.E.L. Aldred, Matching extensions with prescribed and forbidden edges, p.163

Nirmala Achuthan, N.R. Achuthan and M. Simanihuruk, On defective colourings of complementary graphs, p.175

C. Koukouvinos, M. Mitrouli, Jennifer Seberry and P. Karabelas, On sufficient conditions for some orthogonal designs and sequences with zero autocorrelation function, p.197

A. Assaf, A. Mahmoodi, N. Shalaby and J.Yin, Directed packings with block size 5 and odd $v$, p.217

Zhike Jiang, Concerning cyclic group divisible designs with block size three, p.227

D.G. Hoffman, P.D. Johnson, Jr. and E.B. Wantland, Thwart numbers of some bipartite graphs, p.247

D.A. Thomas, Critical points for the Steiner ratio, p.259

Margaret Francel and Dinesh G. Sarvate, Ternary designs with the maximum or near maximum number of replication numbers, p.283

Neal Brand and Margaret Morton, Uniform generalized Steinhaus graphs, p.295