Volume 29 (2004)

  • Anton Betten
  • Danhong Zhang and Hong Wang
    • A minimum degree result for disjoint cycles and forests in bipartite graphs, p.35
    • Download Full Text (163Kb pdf)
  • Stefan Winzen
    • Strong subtournaments of close to regular multipartite tournaments, p.49
    • Download Full Text (131Kb pdf)
  • Elaine M. Eschen and Jianbing Niu
  • E. Boudreau, B. Hartnell, K. Schmeisser and J. Whiteley
  • A.D. Forbes, M.J. Grannell and T.S. Griggs
    • Configurations and trades in Steiner triple systems, p.75
    • Download Full Text (104Kb pdf)
  • Min Ho Lee
  • Dingjun Lou and Huiquan Zhu
    • A note on max-leaves spanning tree problem in Halin graphs, p.95
    • Download Full Text (62Kb pdf)
  • Duncan Campbell and Keith Edwards
    • A new lower bound for the harmonious chromatic number, p.99
    • Download Full Text (71Kb pdf)
  • Toufik Mansour
  • Lutz Volkmann
    • On the size of odd order graphs with no almost perfect matching, p.119
    • Download Full Text (98Kb pdf)
  • Dingjun Lou and Qinglin Yu
  • Zemin Jin and Xueliang Li
  • Laura Harris and Johannes H. Hattingh
    • The algorithmic complexity of certain functional variations of total domination in graphs, p.143
    • Download Full Text (153Kb pdf)
  • K.B. Reid, A.A. McRae, S.M. Hedetniemi and S.T. Hedetniemi
  • Abdollah Khodkar, M.A. Shahabi and S.M. Sheikholeslami
  • Sergey Kitaev
    • The sigma-sequence and counting occurrences of some patterns, subsequences and subwords, p.187
    • Download Full Text (155Kb pdf)
  • Michael U. Gerber and Daniel Kobler
    • Classes of graphs that can be partitioned to satisfy all their vertices, p.201
    • Download Full Text (154Kb pdf)
  • R.E.L. Aldred and Michael D. Plummer
    • Edge proximity and matching extension in planar triangulations, p.215
    • Download Full Text (137Kb pdf)
  • D.G. Hoffman and C.C. Lindner
    • A partial $K_4-e$-design of order $n$ can be embedded in a $K_4-e$-design of order at most $8n+16\sqrt{n}+82$, p.225
    • Download Full Text (125Kb pdf)
  • L. Burnett, W. Millan, E. Dawson and A. Clark
    • Simpler methods for generating better Boolean functions with good cryptographic properties, p.231
    • Download Full Text (145Kb pdf)
  • Atsuhiro Nakamoto
    • Four-regular graphs that quadrangulate both the torus and the Klein bottle, p.249
    • Download Full Text (111Kb pdf)
  • D. Combe, A.M. Nelson and W.D. Palmer
    • Magic labellings of graphs over finite abelian groups, p.259
    • Download Full Text (145Kb pdf)
  • Henning Fernau
  • R.J.R. Abel, D. Combe and W.D. Palmer
  • Christian Sloper
  • Diane Donovan, Saad I. El-Zanati, Charles Vanden Eynden and Somporn Sutinuntopas
  • Kishore Sinha, Sanpei Kageyama, Ashish Das and G.M. Saha
    • Some series of block designs with nested rows and columns, p.337
    • Download Full Text (110Kb pdf)