Volume 14 (1996)

  • Frederic Maire
  • Xueliang Li
  • William Klostermeyer
  • Yoichi Higashiyama, Miro Kraetzl and Lou Caccetta
    • Efficient algorithms for reliability of a consecutive 2-out-of-$r$-from-$n$: F system, p.31
    • Download Full Text (505Kb pdf)
  • Da-Chang Guo
  • Wen-Ai Jackson and Keith M. Martin
  • Spyros S. Magliveras and Wandi Wei
  • Yanjun Li and Cai Mao-cheng
    • A degree condition for the existence of connected factors, p.77
    • Download Full Text (549Kb pdf)
  • Scott T. Chapman and Alfred Geroldinger
  • J. Bell and D.Z. Djokovic
    • Construction of Baumert-Hall-Welch arrays and $T$-matrices, p.93
    • Download Full Text (1224Kb pdf)
  • Ian Mortimer
  • Robert Jajcay and Jozef Širáň
    • More constructions of vertex-transitive non-Cayley graphs based on counting closed walks, p.121
    • Download Full Text (1457Kb pdf)
  • Louis Caccetta and Ruizhong Jia
  • Peter Kyš
  • David Blokh and Gregory Gutin
    • An approximate algorithm for combinatorial optimization problems with two parameters, p.157
    • Download Full Text (860Kb pdf)
  • Marc Gysin and Jennifer Seberry
  • Martin Grüttmüller
  • Hung-Lin Fu and Ming-Chun Tsai
  • Martin Knor
  • F.E. Bennett and L. Zhu
    • Further results on the existence of HSOLSSOM($h^n$), p.207
    • Download Full Text (1411Kb pdf)
  • Ioan Tomescu
  • Dingjun Lou
    • A local neighbourhood condition for $n$-extendable graphs, p.229
    • Download Full Text (661Kb pdf)
  • Ngo Dac Tan
    • On Hamilton cycles in cubic $(m,n)$-metacirculant graphs, II, p.235
    • Download Full Text (2467Kb pdf)
  • L.J. Cummings
  • Dieter Olpp
    • A conjecture of Goodman and the multiplicities of graphs, p.267
    • Download Full Text (1477Kb pdf)
  • Wen-Ai Jackson and Keith M. Martin
    • Efficient constructions for one sharing of many secrets, p.283
    • Download Full Text (1779Kb pdf)
  • M.E. Raines
    • More on embedding partial totally symmetric quasigroups, p.297
    • Download Full Text (1415Kb pdf)
  • Tony Moran
    • Smallest defining sets for 2-(9,4,3) and 3-(10,5,3) designs: Corrigendum, p.311
    • Download Full Text (147Kb pdf)