The Australasian Journal of Combinatorics

Volume 18 (1998)

Roland Lortz and Ingrid Mengersen
- Size Ramsey results for paths versus stars, pp.3–12
D.G. Hoffman and Kimberly S. Kirkpatrick
- $G$-designs of order $n$ and index $\lambda$ where $G$ has 5 vertices or less, pp.13–37
B.S.P. Chan and J.A. Eccleston
- On the construction of complete and partial nearest neighbour balanced designs, pp.39–50
Elizabeth J. Billington and David A. Pike
- Decomposing block-intersection graphs of Steiner triple systems into triangles, pp.51–64
Ljiljana Branković, Mirka Miller, Ján Plesník, Joe Ryan and Jozef Širáň
- Large graphs with small degree and diameter: a voltage assignment approach, pp.65–76
G.F. Steinke
- Finite Möbius near-planes, pp.77–96
R.E.L. Aldred and Nicholas C. Wormald
- More on the linear $k$-arboricity of regular graphs, pp.97–104
Sarah Zahrai
- Minimal bases for the laws of certain cycle systems, pp.105–110
K.T. Arasu
- A reduction theorem for circulant weighing matrices, pp.111–114
Teresa W. Haynes and Michael A. Henning
- Domination critical graphs with respect to relative complements, pp.115–126
Ch. Eslahchi, H. Hajiabolhassan, M.L. Mehrabadi and R. Tusserkani
- A counterexample for Hilton-Johnson's conjecture on list coloring of graphs, pp.127–131
Noboru Ito
- On Hadamard 2-groups, pp.133–137
F. Kamali and H. Kharaghani
- Dihedral Golay sequences, pp.139–145
Cai Heng Li
- On finite graphs that are self-complementary and vertex transitive, pp.147–155
Miwako Mishima, Ying Miao, Sanpei Kageyama and Masakazu Jimbo
- Constructions of nested directed BIB designs, pp.157–172
Alan Hartman
- Algorithmic aspects of integral designs, pp.173–182
M. Flavia Mammana and C.C. Lindner
- A small embedding for partial directed $6k$-cycle systems, pp.183–192
Nicholas J. Cavenagh
- Decompositions of complete tripartite graphs into $k$-cycles, pp.193–200
I.J. Dejter, D.A. Pike and C.A. Rodger
- The directed almost resolvable Hamilton-Waterloo problem, pp.201–208
Elizabeth J. Billington and Giovanni Lo Faro
- Repeated blocks in indecomposable twofold extended triple systems, pp.209–218
Zbigniew Palka
- The strong edge colorings of a sparse random graph, pp.219–226
Shao-Fei Du, Ru-Ji Wang and Ming-Yao Xu
- On the normality of Cayley digraphs of groups of order twice a prime, pp.227–234
Wang Weifan and Zhang Kemin
- Edge-face chromatic number of plane graphs with high maximum degree, pp.235–244
Dieter Rautenbach
- Bounds on the weak domination number, pp.245–251
E.J. Cockayne, O. Favaron, J. Puech and C.M. Mynhardt
- Packing, perfect neighbourhood, irredundant and $R$-annihilated sets in graphs, pp.253–262
M.M. Cropper
- Hall's condition yields less for multicolorings, pp.263–266
Frank Lad
- How big is your mathematics?, pp.267–273
David M. Berman, Jiannong Liu, Hong Wang and Larry Wargo
- Induced stars in trees, pp.275–276
Jan Kratochvíl, Paul Manuel, Mirka Miller and Andrzej Proskurowski
- Disjoint and unfolding domination in graphs, pp.277–292
Meike Tewes and Lutz Volkmann
- On the cycle structure of in-tournaments, pp.293–301
A. Khodkar and Dean G. Hoffman
- On the non-existence of Steiner $(v,k,2)$ trades with certain volumes, pp.303–311
H. Hajiabolhassan and M.L. Mehrabadi
- On clique polynomials, pp.313–316