## Volume 12 (1995)

• Cai-Heng Li
• Isomorphisms and classification of Cayley graphs of small valencies on finite Abelian groups, p.3
• Peter Eades and Xuemin Lin
• 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
• A. El Maftouhi
• The minimum size of a maximal strong matching in a random graph, p.77
• Bolian Liu, Dingjun Lou and Kewen Zhao
• 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
• 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. Östergård
• 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
• B. Du
• On the existence of three incomplete idempotent MOLS, p.193
• R. Klein and J. Schönheim
• 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
• Elizabeth J. Billington and Donald L. Kreher
• Charles J. Colbourn and A. Rosa
• W.P. Galvin
• Single-machine scheduling to minimize absolute lateness for a specified number of tardy jobs, p.271