CMSA LogoAustralasian Journal of Combinatorics

AJC Main page

Previous Volume 11 - Next Volume 13


Contents Volume 12:

Cai-Heng Li, Isomorphisms and classification of Cayley graphs of small valencies on finite Abelian groups, p.3

Peter Eades and Xuemin Lin, A heuristic for the feedback arc set problem, p.15

Ulrich Teschner, A new upper bound for the bondage number of graphs with small domination number, p.27

S. Ajoodani-Namini, Latin and semi-Latin factorizations of complete graphs and support sizes of quadruple systems, p.37

N. Ananchuen and L. Caccetta, A note on $k$-extendable graphs and independence number, p.59

Ladislav Stacho, On minimal outerplanar graphs of given diameter, p.67

A. El Maftouhi, The minimum size of a maximal strong matching in a random graph, p.77

Bolian Liu, Dingjun Lou and Kewen Zhao, A neighbourhood union condition for pancyclicity, p.81

Jixiang Meng and Mingyao Xu, Automorphisms of groups and isomorphisms of Cayley digraphs, p.93

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

C.H.C. Little and H. Wang, Vertex disjoint cycles in a directed graph, p.113

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

J.W. Giffin, K. Watson and L.R. Foulds, Orthogonal layouts using the deltahedron heuristic, p.127

Patric R.J. \"Osterg\aa rd, New multiple covering codes by tabu search, p.145

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

Charles J. Colbourn and L. Zhu, Existence of six incomplete MOLS, p.175

B. Du, On the existence of three incomplete idempotent MOLS, p.193

R. Klein and J. Sch\"onheim, On the colorability of graphs decomposable into degenerate graphs with specified degeneracy, p.201

Giovanni Lo Faro, A class of extended triple systems and numbers of common triples, p.209

D.G. Hoffman, Digraphs of finite linear transformations, p.225

Elizabeth J. Billington and Donald L. Kreher, The intersection problem for small $G$-designs, p.239

Charles J. Colbourn and A. Rosa, Orthogonal resolutions of triple systems, p.259

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

David A. Pike, Hamilton decompositions of line graphs of perfectly 1-factorisable graphs of even degree, p.291

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

Kimmo Eriksson, Classroom note:\quad An easy bijective proof of the matrix-forest theorem, p.301

Edy Tri Baskoro, Mirka Miller, J\'an Plesn\'ik and \v Stefan Zn\'am, Regular digraphs of diamter 2 and maximum order: Corrigenda, p.305