Journal Volumes: Volume 51 (2011)

  • Le Anh Vinh
    • A construction of 3-existentially closed graphs using quadrances, p.3
  • Nicolas Lichiardopol
    • On a conjecture on total domination in claw-free cubic graphs: proof and new upper bound, p.7
  • Andreas Holtkamp and Lutz Volkmann
    • On local connectivity of $K_{2,p}$-free graphs, p.29
  • A. Nagarajan and R. Vasuki
    • On the meanness of arbitrary path super subdivision of paths, p.41
  • Nader Jafari Rad
    • Critical concept for 2-rainbow domination in graphs, p.49
  • Xiaoling Shen and Yaoping Hou
    • The sandpile group of a bilateral regular tree, p.61
  • Lars-Daniel "Ohman
    • Latin squares with prescriptions and restrictions, p.77
  • Roland Lortz and Ingrid Mengersen
    • Ramsey numbers for small graphs versus small disconnected graphs, p.89
  • Elizabeth J. Billington
    • 5-cycle decompositions from paired 3- and 4-cycle decompositions, p.109
  • Adriana Hansberg and Lutz Volkmann
    • 2-domination in bipartite graphs with odd independence number, p.115
  • P. Roushini Leely Pushpam and T.N.M. Malini Mai
    • Weak edge Roman domination in graphs, p.125
  • John Lorch
    • Orthogonal diagonal sudoku solutions: an approach via linearity, p.139
  • Ali Ahmad, K.M. Awan, Imran Javaid and Slamin
    • Total vertex irregularity strength of wheel related graphs, p.147
  • John McCabe and Kathryn Weld
    • On automorphisms of Cayley graphs, and irregular groups, p.157
  • J.S. Kimberley and J.A. MacDougall
    • All regular graphs of small odd order are vertex-magic, p.175
  • Ali Ahmad, Muhammad Faisal Nadeem, Imran Javaid and Roslan Hasni
    • On the super edge-magic deficiency of some families related to ladder graphs, p.201
  • Shasha Li, Xueliang Li and Yongtang Shi
    • The minimal size of a graph with generalized connectivity $\kappa_3 = 2$, p.209
  • Elizabeth J. Billington, Diane Donovan, James Lefevre, Thomas McCourt and C.C. Lindner
    • The triangle intersection problem for nested Steiner triple systems, p.221
  • Weixia Li and Hao Shen
    • Simple 3-designs with block size $d+1$ from PSL$(2,2^n)$ where $d|(2^n-1)$, p.235
  • M.A. Ollis and Devin T. Willmott
    • On twizzler, zigzag and graceful terraces, p.243
  • M.J. Grannell and M. Knor
    • Biembeddings of Latin squares obtained from a voltage construction, p.259
  • A.D. Keedwell
    • A short note regarding existence of complete sets of orthogonal diagonal Sudoku squares, p.271