The Australasian Journal of Combinatorics

Volume 9 (1994)

• David G. Glynn
  • On the construction of arcs using quadrics, pp.3–19

  ---

• Jennifer Seberry and Xian-Mo Zhang
  • Construction of bent functions from two known bent functions, pp.21–35

  ---

• Diane Donovan
  • Some interesting constructions for secret sharing schemes, pp.37–65

  ---

• R.S. Rees, A. Rosa and W.D. Wallis
  • Maximal sets of triangle- factors, pp.67–108

  ---

• Dan Archdeacon, R. Bruce Richter, Josef Širáň and Martin Škoviera
  • Branched coverings of maps and lifts of map homomorphisms, pp.109–121

  ---

• Dingjun Lou
  • Some conditions for $n$-extendable graphs, pp.123–136

  ---

• P.B. Gibbons, E. Mendelsohn and H. Shen
  • Antipodal triple systems, pp.137–151

  ---

• N. Anunchuen and L. Caccetta
  • On minimally $k$-extendable graphs, pp.153–168

  ---

• M.A. Salam and B.G. Wybourne
  • Young raising operators and $Q$-functions, pp.169–177

  ---

• C.P. Bonnington and C.H.C. Little
  • A combinatorial generalisation of the Jordan curve theorem, pp.179–199

  ---

• A. Khodkar
  • Various super-simple designs with block size four, pp.201–210

  ---

• Claude Berge
  • About vertex-critical non-bicolorable hypergraphs, pp.211–219

  ---

• Stanisław P. Radziszowski and Xia Jin
  • Paths, cycles and wheels in graphs without antitriangles, pp.221–232

  ---

• Johannes H. Hattingh, Michael A. Henning and Peter J. Slater
  • Three-valued $k$-neighborhood domination in graphs, pp.233–242

  ---

• L. Caccetta and S. Mardiyono
  • On the existence of almost-regular- graphs without one-factors, pp.243–260

  ---

• Marks R. Nester
  • $HAHA$ designs, pp.261–274

  ---

• Ferdinand Gliviak, Martin Knor and Lubomír Šoltés
  • On radially maximal graphs, pp.275–284

  ---

• Darryn E. Bryant, Saad I. El-Zanati and Robert B. Gardner
  • Decompositions of $K_{m,n}$ and $K_n$ into cubes, pp.285–290

  ---

• Edy Tri Baskoro, Mirka Miller, Ján Plesník and Štephan Znám
  • Regular digraphs of diameter 2 and maximum order, pp.291–306

  ---

• Bert Randerath and Lutz Volkmann
  • A characterization of well covered block-cactus graphs, pp.307–314

  ---