Australasian Journal of Combinatorics

Contents Volume 14:

Frederic Maire, Optimizing slightly triangulated graphs, p.5

Xueliang Li, On a conjecture of Merrifield and Simmons, p.15

William Klostermeyer, Path problems in dynamically orientable graphs, p.21

Yoichi Higashiyama, Miro Kraetzl and Lou Caccetta, Efficient algorithms for reliability of a consecutive 2-out-of-$r$-from-$n$: F system, p.31

Da-Chang Guo, 5-valent symmetric graphs of order at most 100, p.37

Wen-Ai Jackson and Keith M. Martin, A combinatorial interpretation of ramp schemes, p.51

Spyros S. Magliveras and Wandi Wei, Enumeration of certain binary vectors, p.61

Yanjun Li and Cai Mao-cheng, A degree condition for the existence of connected factors, p.77

Scott T. Chapman and Alfred Geroldinger, On cross numbers of minimal zero sequences, p.85

J. Bell and D.Z. Djokovic, Construction of Baumert-Hall-Welch arrays and $T$-matrices, p.93

Ian Mortimer, The intersection problem for a five vertex dragon, p.109

Robert Jajcay and Jozef \v Sir\'a\v n, More constructions of vertex-transitive non-Cayley graphs based on counting closed walks, p.121

Louis Caccetta and Ruizhong Jia, Positive binary labelling of graphs, p.133

Peter Ky\v s, Graphs with equidistant central nodes, p.149

David Blokh and Gregory Gutin, An approximate algorithm for combinatorial optimization problems with two parameters, p.157

Marc Gysin and Jennifer Seberry, Multiplications of ternary complementary pairs, p.165

Martin Gr\"uttm\"uller, On the number of indecomposable block designs, p.181

Hung-Lin Fu and Ming-Chun Tsai, The maximum genus of diameter three graphs, p.187

Martin Knor, On Ramsey-type games for graphs, p.199

F.E. Bennett and L. Zhu, Further results on the existence of HSOLSSOM($h^n$), p.207

Ioan Tomescu, The number of digraphs with small diameter, p.221

Dingjun Lou, A local neighbourhood condition for $n$-extendable graphs, p.229

Ngo Dac Tan, On Hamilton cycles in cubic $(m,n)$-metacirculant graphs, II, p.235

L.J. Cummings, Strongly square-free strings on three letters, p.259

Dieter Olpp, A conjecture of Goodman and the multiplicities of graphs, p.267

Wen-Ai Jackson and Keith M. Martin, Efficient constructions for one sharing of many secrets, p.283

M.E. Raines, More on embedding partial totally symmetric quasigroups, p.297

Tony Moran, Smallest defining sets for 2-(9,4,3) and 3-(10,5,3) designs: Corrigendum, p.311