Volume 32 (2005)

  • Hung-Lin Fu
  • Peter Pleasants, Harry Ray and Jamie Simpson
  • Bill Calhoun, Kevin Ferland, Lisa Lister and John Polhill
  • Mingyuan Xia, Tianbing Xia, Jennifer Seberry and Guoxin Zuo
  • Shinya Fujita
    • Partition of a graph into cycles and isolated vertices, p.79
    • Download Full Text (195Kb pdf)
  • Lynne L. Doty and Kevin K. Ferland
  • Yoshimi Egawa and Masao Tsugaki
    • A bound on the order of a graph when both the graph and its complement are contraction-critically $k$-connected, p.105
    • Download Full Text (156Kb pdf)
  • S.A. Choudum and M.A. Shalu
  • Weizhen Gu, Xingde Jia and Haidong Wu
  • Atif A. Abueida, Mike Daven and Kenneth J. Roblee
    • Multidesigns of the $\lambda$-fold complete graph for graph-pairs of orders 4 and 5, p.125
    • Download Full Text (188Kb pdf)
  • Mary Waterhouse
    • Some equitably 2 and 3-colourable cube decompositions, p.137
    • Download Full Text (171Kb pdf)
  • Narong Punnim
  • Thomas Lam
  • Tsuyoshi Nishimura
  • Irène Charon, Olivier Hudry and Antoine Lobstein
    • Possible cardinalities for identifying codes in graphs, p.177
    • Download Full Text (257Kb pdf)
  • Yan Zhang and Beiliang Du
    • The existence of resolvable Mendelsohn designs RMD$(\{3,s^*\},v)$, p.197
    • Download Full Text (151Kb pdf)
  • G. Sethuraman and A. Elumalai
    • Gracefulness of a cycle with parallel $P_k$-chords, p.205
    • Download Full Text (167Kb pdf)
  • K.T. Arasu and Surinder Sehgal
  • R.M. Figueroa-Centeno, R. Ichishima and F.A. Muntaner-Batle
    • On edge-magic labelings of certain disjoint unions of graphs, p.225
    • Download Full Text (230Kb pdf)
  • Ashish Das, Aloke Dey, Sanpei Kageyama and Kishore Sinha
    • $A$-efficient balanced treatment incomplete block designs, p.243
    • Download Full Text (166Kb pdf)
  • Mukul Subodh Bansal and V.Ch. Venkaiah
    • A note on finding a maximum clique in a graph using BDDs, p.253
    • Download Full Text (135Kb pdf)
  • Ngo Dac Tan and Tran Minh Tuoc
    • An algorithm for determining connectedness of tetravalent metacirculant graphs, p.259
    • Download Full Text (269Kb pdf)
  • Igor' É. Zverovich and Inessa I. Zverovich
    • Ratio of generalized stability and domination parameters, p.279
    • Download Full Text (153Kb pdf)
  • Nicholas Cavenagh, Diane Donovan and Aleš Drápal
  • M.M.M. Jaradat and Maref Y. Alzoubi
    • An upper bound of the basis number of the lexicographic product of graphs, p.305
    • Download Full Text (175Kb pdf)
  • M. Arian-Nejad and M. Emami
  • Elizabeth J. Billington, C.C. Lindner and A. Rosa
    • Lambda-fold complete graph decompositions into perfect four-triple configurations, p.323
    • Download Full Text (169Kb pdf)
  • E.S. Yazici
    • Metamorphosis of 2-fold 4-cycle systems into maximum packings of 2-fold 6-cycle systems, p.331
    • Download Full Text (187Kb pdf)
  • W.D. Wallis and R.A. Yates