Volume 33 (2005)

  • Elias Dahlhaus, Paul D. Manuel and Mirka Miller
    • Parallel algorithms for generalized clique transversal problems, p.3
    • Download Full Text (269Kb pdf)
  • Izak Broere, Elizabeth Jonck, Gayla S. Domke and Lisa R. Markus
    • The induced path number of the complements of some graphs, p.15
    • Download Full Text (251Kb pdf)
  • M.H. Albert, R.E.L. Aldred, M.D. Atkinson, H.P. van Ditmarsch and C.C. Handley
    • Safe communication for card players by combinatorial designs for two-step protocols, p.33
    • Download Full Text (215Kb pdf)
  • Junling Zhou and Yanxun Chang
    • Product constructions for large sets of resolvable MTSs and DTSs, p.47
    • Download Full Text (206Kb pdf)
  • Ian T. Roberts and Leanne J. Rylands
    • Minimal $(n)$ and $(n,h,k)$ Completely Separating Systems, p.57
    • Download Full Text (183Kb pdf)
  • J. Wang
  • Sarita Rudra, Shakti Banerjee and Sanpei Kageyama
    • Constructions of 3-resolvable nested 3-designs and 3-wise balanced designs, p.77
    • Download Full Text (160Kb pdf)
  • Ian T. Roberts
    • Completely separating systems of $k$-sets for $7 \leq k \leq 10$, p.87
    • Download Full Text (207Kb pdf)
  • Christian Barrientos
  • Rita SahaRay, Avishek Adhikari and Jennifer Seberry
    • Critical sets in orthogonal arrays with 7 and 9 levels, p.109
    • Download Full Text (217Kb pdf)
  • A. Cossidente and A. Siciliano
    • On the largest minimal blocking set in PG$({\mathbb {F}_8})$, p.125
    • Download Full Text (134Kb pdf)
  • Jian Wang
  • Qin Chengfu, Yuan Xudong and Su Jianji
    • Triangles in contraction critical 5-connected graphs, p.139
    • Download Full Text (180Kb pdf)
  • Yejing Wang, Jennifer Seberry, Beata J. Wysocki, Tadeusz A. Wysocki, Le Chung Tran, Ying Zhao and Tianbing Xia
  • Yuejian Peng and Cheng Zhao
    • On incomparable and uncomplemented families of sets, p.157
    • Download Full Text (197Kb pdf)
  • Dalibor Fronček, Petr Kovář and Tereza Kovářová
  • Antonio Pasini
    • A tower of geometries related to the ternary Golay codes, p.183
    • Download Full Text (353Kb pdf)
  • Martin Hessler
    • A computer study of some 1-error correcting perfect binary codes, p.217
    • Download Full Text (182Kb pdf)
  • Dimitri Leemans
    • The residually weakly primitive geometries of $\sf HS$, p.231
    • Download Full Text (143Kb pdf)
  • D.A. Preece, W.D. Wallis and J.L. Yucas
  • Lucia Gionfriddo and C.C. Lindner
  • Ju Zhou and Jinjiang Yuan
    • Characterization of induced matching extendable graphs with $2n$ vertices and $3n-1$ edges, p.255
    • Download Full Text (191Kb pdf)
  • Angelika Hellwig and Lutz Volkmann
    • Neighborhood conditions for graphs and digraphs to be maximally edge-connected, p.265
    • Download Full Text (196Kb pdf)
  • W. Duckworth
  • Y. Bani Hammad, G. Carter, E. Dawson, W. Müller and Y. Hitchcock
  • Michel Lavrauw and Maska Law
  • Mostafa Blidia, Mustapha Chellali and Odile Favaron
  • Hong Wang
    • On large cycles with lengths differing by one or two, p.329
    • Download Full Text (135Kb pdf)
  • Angelo Sonnino