Volume 12 (1995)

  • Cai-Heng Li
    • Isomorphisms and classification of Cayley graphs of small valencies on finite Abelian groups, p.3
    • Download Full Text (1514Kb pdf)
  • Peter Eades and Xuemin Lin
  • Ulrich Teschner
    • A new upper bound for the bondage number of graphs with small domination number, p.27
    • Download Full Text (783Kb pdf)
  • S. Ajoodani-Namini
    • Latin and semi-Latin factorizations of complete graphs and support sizes of quadruple systems, p.37
    • Download Full Text (2024Kb pdf)
  • N. Ananchuen and L. Caccetta
    • A note on $k$-extendable graphs and independence number, p.59
    • Download Full Text (522Kb pdf)
  • Ladislav Stacho
  • A. El Maftouhi
    • The minimum size of a maximal strong matching in a random graph, p.77
    • Download Full Text (314Kb pdf)
  • Bolian Liu, Dingjun Lou and Kewen Zhao
  • Jixiang Meng and Mingyao Xu
    • Automorphisms of groups and isomorphisms of Cayley digraphs, p.93
    • Download Full Text (828Kb pdf)
  • Johannes H. Hattingh, Michael A. Henning and Peter J. Slater
    • The algorithmic complexity of signed domination in graphs, p.101
    • Download Full Text (1413Kb pdf)
  • 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
    • Download Full Text (803Kb pdf)
  • J.W. Giffin, K. Watson and L.R. Foulds
    • Orthogonal layouts using the deltahedron heuristic, p.127
    • Download Full Text (2005Kb pdf)
  • 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
    • Download Full Text (1856Kb pdf)
  • Charles J. Colbourn and L. Zhu
  • B. Du
    • On the existence of three incomplete idempotent MOLS, p.193
    • Download Full Text (648Kb pdf)
  • R. Klein and J. Schönheim
    • On the colorability of graphs decomposable into degenerate graphs with specified degeneracy, p.201
    • Download Full Text (682Kb pdf)
  • Giovanni Lo Faro
    • A class of extended triple systems and numbers of common triples, p.209
    • Download Full Text (1157Kb pdf)
  • 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
    • Download Full Text (2128Kb pdf)
  • David A. Pike
    • Hamilton decompositions of line graphs of perfectly 1-factorisable graphs of even degree, p.291
    • Download Full Text (425Kb pdf)
  • M.L. Aggarwal and K.T. Arasu
    • A new family of balanced incomplete block designs with nested rows and columns, p.295
    • Download Full Text (495Kb pdf)
  • Kimmo Eriksson
    • Classroom note: An easy bijective proof of the matrix-forest theorem, p.301
    • Download Full Text (372Kb pdf)
  • Edy Tri Baskoro, Mirka Miller, Ján Plesník and Štefan Znám
    • Regular digraphs of diamter 2 and maximum order: Corrigenda, p.305
    • Download Full Text (169Kb pdf)