The Australasian Journal of Combinatorics

Volume 14 (1996)

• Frederic Maire
  • Optimizing slightly triangulated graphs, pp.5–13

  ---

• Xueliang Li
  • On a conjecture of Merrifield and Simmons, pp.15–20

  ---

• William Klostermeyer
  • Path problems in dynamically orientable graphs, pp.21–30

  ---

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

  ---

• Da-Chang Guo
  • 5-valent symmetric graphs of order at most 100, pp.37–50

  ---

• Wen-Ai Jackson and Keith M. Martin
  • A combinatorial interpretation of ramp schemes, pp.51–60

  ---

• Spyros S. Magliveras and Wandi Wei
  • Enumeration of certain binary vectors, pp.61–75

  ---

• Yanjun Li and Cai Mao-cheng
  • A degree condition for the existence of connected factors, pp.77–83

  ---

• Scott T. Chapman and Alfred Geroldinger
  • On cross numbers of minimal zero sequences, pp.85–92

  ---

• J. Bell and D.Z. Djokovic
  • Construction of Baumert-Hall-Welch arrays and $T$-matrices, pp.93–107

  ---

• Ian Mortimer
  • The intersection problem for a five vertex dragon, pp.109–120

  ---

• Robert Jajcay and Jozef Širáň
  • More constructions of vertex-transitive non-Cayley graphs based on counting closed walks, pp.121–132

  ---

• Louis Caccetta and Ruizhong Jia
  • Positive binary labelling of graphs, pp.133–148

  ---

• Peter Kyš
  • Graphs with equidistant central nodes, pp.149–156

  ---

• David Blokh and Gregory Gutin
  • An approximate algorithm for combinatorial optimization problems with two parameters, pp.157–164

  ---

• Marc Gysin and Jennifer Seberry
  • Multiplications of ternary complementary pairs, pp.165–180

  ---

• Martin Grüttmüller
  • On the number of indecomposable block designs, pp.181–186

  ---

• Hung-Lin Fu and Ming-Chun Tsai
  • The maximum genus of diameter three graphs, pp.187–197

  ---

• Martin Knor
  • On Ramsey-type games for graphs, pp.199–206

  ---

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

  ---

• Ioan Tomescu
  • The number of digraphs with small diameter, pp.221–227

  ---

• Dingjun Lou
  • A local neighbourhood condition for $n$-extendable graphs, pp.229–233

  ---

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

  ---

• L.J. Cummings
  • Strongly square-free strings on three letters, pp.259–266

  ---

• Dieter Olpp
  • A conjecture of Goodman and the multiplicities of graphs, pp.267–282

  ---

• Wen-Ai Jackson and Keith M. Martin
  • Efficient constructions for one sharing of many secrets, pp.283–296

  ---

• M.E. Raines
  • More on embedding partial totally symmetric quasigroups, pp.297–309

  ---

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

  ---