The Australasian Journal of Combinatorics

Volume 12 (1995)

• Cai-Heng Li
  • Isomorphisms and classification of Cayley graphs of small valencies on finite Abelian groups, pp.3–14

  ---

• Peter Eades and Xuemin Lin
  • A heuristic for the feedback arc set problem, pp.15–25

  ---

• Ulrich Teschner
  • A new upper bound for the bondage number of graphs with small domination number, pp.27–35

  ---

• S. Ajoodani-Namini
  • Latin and semi-Latin factorizations of complete graphs and support sizes of quadruple systems, pp.37–58

  ---

• N. Ananchuen and L. Caccetta
  • A note on $k$-extendable graphs and independence number, pp.59–65

  ---

• Ladislav Stacho
  • On minimal outerplanar graphs of given diameter, pp.67–76

  ---

• A. El Maftouhi
  • The minimum size of a maximal strong matching in a random graph, pp.77–80

  ---

• Bolian Liu, Dingjun Lou and Kewen Zhao
  • A neighbourhood union condition for pancyclicity, pp.81–91

  ---

• Jixiang Meng and Mingyao Xu
  • Automorphisms of groups and isomorphisms of Cayley digraphs, pp.93–100

  ---

• Johannes H. Hattingh, Michael A. Henning and Peter J. Slater
  • The algorithmic complexity of signed domination in graphs, pp.101–112

  ---

• C.H.C. Little and H. Wang
  • Vertex disjoint cycles in a directed graph, pp.113–119

  ---

• C.C. Lindner and C.A. Rodger
  • Blocking set preserving embeddings of partial $K_4\,-\,e$ designs, pp.121–126

  ---

• J.W. Giffin, K. Watson and L.R. Foulds
  • Orthogonal layouts using the deltahedron heuristic, pp.127–144

  ---

• Patric R.J. Östergård
  • New multiple covering codes by tabu search, pp.145–155

  ---

• Marc Gysin and Jennifer Seberry
  • On the weighing matrices of order $4n$ and weight $4n-2$ and $2n-1$, pp.157–174

  ---

• Charles J. Colbourn and L. Zhu
  • Existence of six incomplete MOLS, pp.175–191

  ---

• B. Du
  • On the existence of three incomplete idempotent MOLS, pp.193–199

  ---

• R. Klein and J. Schönheim
  • On the colorability of graphs decomposable into degenerate graphs with specified degeneracy, pp.201–208

  ---

• Giovanni Lo Faro
  • A class of extended triple systems and numbers of common triples, pp.209–224

  ---

• D.G. Hoffman
  • Digraphs of finite linear transformations, pp.225–237

  ---

• Elizabeth J. Billington and Donald L. Kreher
  • The intersection problem for small $G$-designs, pp.239–258

  ---

• Charles J. Colbourn and A. Rosa
  • Orthogonal resolutions of triple systems, pp.259–269

  ---

• W.P. Galvin
  • Single-machine scheduling to minimize absolute lateness for a specified number of tardy jobs, pp.271–289

  ---

• David A. Pike
  • Hamilton decompositions of line graphs of perfectly 1-factorisable graphs of even degree, pp.291–294

  ---

• M.L. Aggarwal and K.T. Arasu
  • A new family of balanced incomplete block designs with nested rows and columns, pp.295–299

  ---

• Kimmo Eriksson
  • Classroom note: An easy bijective proof of the matrix-forest theorem, pp.301–303

  ---

• Edy Tri Baskoro, Mirka Miller, Ján Plesník and Štefan Znám
  • Regular digraphs of diamter 2 and maximum order: Corrigenda, p.305

  ---