Volume 70 (2018)

  • Part 1

  • Xueliang Li and Yan Zhao
    • On extremal graphs with exactly one Steiner tree connecting any $k$ vertices, p.1
    • Download Full Text (146Kb pdf)
  • Slobodan Filipovski
  • Elia Saini
    • A new presentation for the inner Tutte group of a matroid, p.15
    • Download Full Text (141Kb pdf)
  • Yaping Mao
    • Constructing internally disjoint pendant Steiner trees in Cartesian product networks, p.28
    • Download Full Text (237Kb pdf)
  • A.D. Forbes and T.S. Griggs
    • Designs for graphs with six vertices and nine edges, p.52
    • Download Full Text (286Kb pdf)
  • Mohsen Aliabadi and Mano Vikash Janardhanan
    • On local matching property in groups and vector spaces, p.75
    • Download Full Text (108Kb pdf)
  • William J. Keith, Dalibor Froncek and Donald L. Kreher
  • Catarina P. Avelino and Altino F. Santos
    • Geometric and combinatorial structure of a class of spherical folding tesselations - II, p.104
    • Download Full Text (402Kb pdf)
  • Mujiangshan Wang, Yuqing Lin, Shiying Wang and Meiyu Wang
    • Sufficient conditions for graphs to be maximally 4-restricted edge connected, p.123
    • Download Full Text (143Kb pdf)
  • Lin Chen, Xueliang Li, Henry Liu and Jinfeng Liu
    • On various (strong) rainbow connection numbers of graphs, p.137
    • Download Full Text (186Kb pdf)
  • Wai Chee Shiu and Richard M. Low
    • The integer-magic spectra and null sets of the Cartesian product of trees, p.157
    • Download Full Text (114Kb pdf)
  • Part 2

  • Grace Misereh and Yuri Nikolayevsky
  • Agnese Baldisserri and Elena Rubei
    • Distance matrices of some positive-weighted graphs, p.185
    • Download Full Text (168Kb pdf)
  • Ji-Hwan Jung, István Mező and José L. Ramírez
  • Katherine F. Benson, Daniela Ferrero, Mary Flagg, Veronika Furst, Leslie Hogben, Violeta Vasilevska and Brian Wissman
    • Zero forcing and power domination for graph products, p.221
    • Download Full Text (340Kb pdf)
  • David Galvin and Justin Hilyard
    • The independent set sequence of some families of trees, p.236
    • Download Full Text (159Kb pdf)
  • Amir Barghi
  • Mária Timková
  • Akihiro Munemasa and Pritta Etriana Putri
  • Masaaki Harada and Ken Saito
    • Singly even self-dual codes constructed from Hadamard matrices of order 28, p.288
    • Download Full Text (104Kb pdf)
  • Part 3

  • Johannes H. Hattingh and Ernst J. Joubert
    • The product of the total restrained domination numbers of a graph and its complement, p.297
    • Download Full Text (133Kb pdf)
  • Tsz Lung Chan
  • Bryan Freyberg and Melissa Keranen
    • Orientable $\mathbb{Z}_{n}$-distance magic graphs via products, p.319
    • Download Full Text (115Kb pdf)
  • Erik Thörnblad
    • Eplett's theorem for self-converse generalised tournaments, p.329
    • Download Full Text (88Kb pdf)
  • Yoshimi Egawa and Michitaka Furuya
  • D. González-Moreno and R. Hernández Ortiz
    • A note on the restricted arc connectivity of oriented graphs of girth four, p.340
    • Download Full Text (320Kb pdf)
  • Guoliang Hao, Doost Ali Mojdeh, Shouliu Wei and Zhihong Xie
    • Rainbow domination in the Cartesian product of directed paths, p.349
    • Download Full Text (125Kb pdf)
  • Dursun A. Bulutoglu and Kenneth J. Ryan
    • Integer programming for classifying orthogonal arrays, p.362
    • Download Full Text (210Kb pdf)
  • Anthony D. Forbes, Terry S. Griggs and Kim A. Forbes
    • Completing the design spectra for graphs with six vertices and eight edges, p.386
    • Download Full Text (62Kb pdf)
  • Melody Bruce. Mark Budden and Josh Hiller
    • Lexicographic products of $r$-uniform hypergraphs and some applications to hypergraph Ramsey theory, p.390
    • Download Full Text (337Kb pdf)
  • Richard Ehrenborg and Alex Happ