Volume 39 (2007)

  • D.J. Ashe, David Leach and C.A. Rodger
  • Tiffany Rose Andrus and Neil P. Carnes
    • A class of antiautomorphisms of Mendelsohn triple systems with two cycles, p.19
    • Download Full Text (135Kb pdf)
  • Lingli Sun
    • The Erdős-Sós conjecture for spiders of diameter 9, p.27
    • Download Full Text (212Kb pdf)
  • Ilias S. Kotsireas and Christos Koukouvinos
    • Orthogonal designs of order 32 and 64 via computational algebra, p.39
    • Download Full Text (207Kb pdf)
  • A. Sapounakis, I. Tasoulas and P. Tsikouras
  • Mieko Yamada
    • Supplementary difference sets constructed from $(q+1)$st cyclotomic classes in GF$(q^2)$, p.73
    • Download Full Text (223Kb pdf)
  • Grady Bullington, Linda Eroh, Kevin McDougal, Hosien Moghadam and Steven J. Winters
  • Narong Punnim
  • Tatjana Gerzen and Bert Randerath
  • Clay Culver and David Leach
  • Richard H. Hammack
  • Veerle Fack and Brendan D. McKay
    • A generalized switching method for combinatorial estimation, p.141
    • Download Full Text (232Kb pdf)
  • Yunjian Wu and Qinglin Yu
  • T. Aaron Gulliver, Masaaki Harada and Hiroki Miyabayashi
    • Optimal double circulant self-dual codes over \mathbb{F}_4$ II, p.163
    • Download Full Text (231Kb pdf)
  • Xuelian Wen and Dingjun Lou
    • Path decomposition of defect 1-extendable bipartite graphs, p.175
    • Download Full Text (161Kb pdf)
  • Tomáš Vetrík
    • Factorization of complete graphs into three factors with the smallest diameter equal to 3 or 4, p.183
    • Download Full Text (171Kb pdf)
  • Chengmin Wang
    • Resolvable holey group divisible designs with block size three, p.191
    • Download Full Text (240Kb pdf)
  • Sasha Logan Jarrell and C.A. Rodger
    • Maximal sets of Hamilton cycles in complete multipartite graphs II, p.207
    • Download Full Text (193Kb pdf)
  • Mostafa Blidia, Mustapha Chellali, Frédéric Maffray, Julien Moncel and Ahmed Semri
    • Locating-domination and identifying codes in trees, p.219
    • Download Full Text (238Kb pdf)
  • Sascha Kurz and Reinhard Laue
    • Bounds for the minimum diameter of integral point sets, p.233
    • Download Full Text (281Kb pdf)
  • G.R. Vijayakumar
    • Partitions of the edge set of a graph into internally disjoint paths, p.241
    • Download Full Text (161Kb pdf)
  • Ian M. Wanless
  • Antonio Bernini and Luca Ferrari
    • Order properties of the Motzkin and Schroder families, p.259
    • Download Full Text (245Kb pdf)
  • Elie Feder and David Garber
    • Towards the computation of the convex hull of a configuration from its corresponding separating matrix, p.273
    • Download Full Text (172Kb pdf)
  • S. Arumugam, K. Jacob and Lutz Volkmann
  • T.W. Cusick, H. Fredricksen and P. Stănică
  • Dirk Meierling and Lutz Volkmann
    • On the number of nonseparating vertices in strongly connected local tournaments, p.301
    • Download Full Text (219Kb pdf)