Australasian Journal of Combinatorics

Previous Volume 17 - Next Volume 19

Contents Volume 18:

Roland Lortz and Ingrid Mengersen, Size Ramsey results for paths versus stars, p.3

D.G. Hoffman and Kimberly S. Kirkpatrick, $G$-designs of order $n$ and index $\lambda$ where $G$ has 5 vertices or less, p.13

B.S.P. Chan and J.A. Eccleston, On the construction of complete and partial nearest neighbour balanced designs, p.39

Elizabeth J. Billington and David A. Pike, Decomposing block-intersection graphs of Steiner triple systems into triangles, p.51

Ljiljana Brankovi\'c, Mirka Miller, J\'an Plesn\'\i k, Joe Ryan and Jozef \v Sir\'a\v n, Large graphs with small degree and diameter: a voltage assignment approach, p.65

G.F. Steinke, Finite M\"obius near-planes, p.77

R.E.L. Aldred and Nicholas C. Wormald, More on the linear $k$-arboricity of regular graphs, p.97

Sarah Zahrai, Minimal bases for the laws of certain cycle systems, p.105

K.T. Arasu, A reduction theorem for circulant weighing matrices, p.111

Teresa W. Haynes and Michael A. Henning, Domination critical graphs with respect to relative complements, p.115

Ch. Eslahchi, H. Hajiabolhassan, M.L. Mehrabadi and R. Tusserkani, A counterexample for Hilton-Johnson's conjecture on list coloring of graphs, p.127

Noboru Ito, On Hadamard 2-groups, p.133

F. Kamali and H. Kharaghani, Dihedral Golay sequences, p.139

Cai Heng Li, On finite graphs that are self-complementary and vertex transitive, p.147

Miwako Mishima, Ying Miao, Sanpei Kageyama and Masakazu Jimbo, Constructions of nested directed BIB designs, p.157

Alan Hartman, Algorithmic aspects of integral designs, p.173

M. Flavia Mammana and C.C. Lindner, A small embedding for partial directed $6k$-cycle systems, p.183

Nicholas J. Cavenagh, Decompositions of complete tripartite graphs into $k$-cycles, p.193

I.J. Dejter, D.A. Pike and C.A. Rodger, The directed almost resolvable Hamilton-Waterloo problem, p.201

Elizabeth J. Billington and Giovanni Lo Faro, Repeated blocks in indecomposable twofold extended triple systems, p.209

Zbigniew Palka, The strong edge colorings of a sparse random graph, p.219

Shao-Fei Du, Ru-Ji Wang and Ming-Yao Xu, On the normality of Cayley digraphs of groups of order twice a prime, p.227

Wang Weifan and Zhang Kemin, Edge-face chromatic number of plane graphs with high maximum degree, p.235

Dieter Rautenbach, Bounds on the weak domination number, p.245

E.J. Cockayne, O. Favaron, J. Puech and C.M. Mynhardt, Packing, perfect neighbourhood, irredundant and $R$-annihilated sets in graphs, p.253

M.M. Cropper, Hall's condition yields less for multicolorings, p.263

Frank Lad, How big is your mathematics?, p.267

David M. Berman, Jiannong Liu, Hong Wang and Larry Wargo, Induced stars in trees, p.275

Jan Kratochv\'\i l, Paul Manuel, Mirka Miller and Andrzej Proskurowski, Disjoint and unfolding domination in graphs, p.277

Meike Tewes and Lutz Volkmann, On the cycle structure of in-tournaments, p.293

A. Khodkar and Dean G. Hoffman, On the non-existence of Steiner $(v,k,2)$ trades with certain volumes, p.303

H. Hajiabolhassan and M.L. Mehrabadi, On clique polynomials, p.313