Volume 41 (2008)

  • Yuejian Peng
  • M. E. Messinger
  • Hongtao Zhao and Yanfang Zhang
    • Partitioning sets of oriented triples into the smallest nontrivial oriented triple systems, p.29
    • Download Full Text (93Kb pdf)
  • Peter Danziger and Chengmin Wang
    • Resolvable modified group divisible designs with higher index, p.37
    • Download Full Text (96Kb pdf)
  • Boštjan Brešar and Simon Špacapan
    • On the connectivity of the direct product of graphs, p.45
    • Download Full Text (148Kb pdf)
  • Andrew Beveridge and Oleg Pikhurko
  • Eyal Loz and Jozef Širáň
  • Tero Laihonen and Julien Moncel
  • Ján Plesník
    • Examples of goal-minimally $k$-diametric graphs for some small values of $k$, p.93
    • Download Full Text (174Kb pdf)
  • Criel Merino
    • On the number of tilings of the rectangular board with T-tetronimoes, p.107
    • Download Full Text (133Kb pdf)
  • Jocelyn Quaintance
    • Letter representations of $n\times n\times p$ proper arrays, p.115
    • Download Full Text (548Kb pdf)
  • Dean Crnković
    • A series of Siamese twin designs intersecting in a BIBD and a PBD, p.139
    • Download Full Text (94Kb pdf)
  • W. C. Shiu and Richard M. Low
  • Kannan Balakrishnan, Manoj Changat, Sandi Klavžar, Joseph Mathews, Iztok Peterin, G. N. Prasanth and Simon Špacapan
  • D. Wu, Z. Chen and M. Cheng
    • A note on the existence of balanced $(q,{3,4},1)$ difference families, p.171
    • Download Full Text (66Kb pdf)
  • C. A. Baker and J. D. A. Manzer
    • Skolem-labeling of generalized three-vane windmills, p.175
    • Download Full Text (239Kb pdf)
  • Zeling Shao and Yanpei Liu
    • Genus distributions of orientable embeddings for two types of graphs, p.205
    • Download Full Text (143Kb pdf)
  • Lutz Volkmann
    • A characterization of bipartite graphs with independence number half their order, p.219
    • Download Full Text (73Kb pdf)
  • Henry Martyn Mulder, Michael J. Pelsmajer and K. B. Reid
  • Giuseppe Mazzuoccolo
    • Perfect one-factorizations in line-graphs and planar graphs, p.227
    • Download Full Text (103Kb pdf)
  • I. S. Kotsireas and C. Koukouvinos
    • New skew-Hadamard matrices via computational algebra, p.235
    • Download Full Text (157Kb pdf)
  • Adelaide Rose Merlyn Saldanha and S. Parameshwara Bhatta
    • On counting $n$-element trellises having exactly one pair of noncomparable elements, p.249
    • Download Full Text (108Kb pdf)
  • Andrei Gagarin
    • Improved upper bounds for the $k$-tuple domination number, p.257
    • Download Full Text (85Kb pdf)
  • Changping Wang
  • Andrea Vietri
    • A new infinite family of graceful generalised Petersen graphs, via graceful collages again, p.273
    • Download Full Text (306Kb pdf)
  • K. Ramanjaneyulu, V. Ch. Venkaiah and Kishore Kothapalli
  • H. Karami, S. M. Sheikholeslami and Abdollah Khodkar
  • D. A. Preece