Volume 34 (2006)

  • Lubica Liskova
    • Cayley maps with given exponents and distribution of inverses, p.3
    • Download Full Text (214Kb pdf)
  • Gregory Gutin and Arash Rafiey
    • Multipartite tournaments with small number of cycles, p.17
    • Download Full Text (145Kb pdf)
  • Irene Charon, Olivier Hudry and Antoine Lobstein
    • Possible cardinalities for locating-dominating codes in graphs, p.23
    • Download Full Text (186Kb pdf)
  • Xuebin Zhang
  • Richard M. Low and Sin-Min Lee
  • Tan Xuezhong and Liu Bolian
    • On the spectrum of the quasi-laplacian matrix of a graph, p.49
    • Download Full Text (169Kb pdf)
  • V. V. Lozin and D. Rautenbach
    • The tree- and clique-width of bipartite graphs in special classes, p.57
    • Download Full Text (193Kb pdf)
  • K. M. Koh and E. G. Tay
    • On optimal orientations of tree vertex-multiplications, p.69
    • Download Full Text (296Kb pdf)
  • Peter Abramenko and Hendrik Van Maldeghem
    • Combinatorial characterizations of convexity and apartments in buildings, p.89
    • Download Full Text (240Kb pdf)
  • Tianbing Xia, Mingyuan Xia, Jennifer Seberry and Jing Wu
    • Hadamard matrices constructed by circulant and negacyclic matrices, p.105
    • Download Full Text (204Kb pdf)
  • S. Taylor, I. M. Wanless and N. L. Boland
    • Distance domination and amplifier placement problems, p.117
    • Download Full Text (270Kb pdf)
  • Ying Zhao, Beata J. Wysocki, Tadeusz A. Wysocki and Le Chung Tran
    • Amicable orthogonal designs of order 8 for complex space-time block codes, p.137
    • Download Full Text (198Kb pdf)
  • Peter Adams, Darryn Bryant, Mike Grannell and Terry Griggs
  • Doostali Mojdeh
    • On conjectures on the defining set of (vertex) graph colourings, p.153
    • Download Full Text (152Kb pdf)
  • Olexandr Ganyushkin and Volodymyr Mazorchuk
    • Combinatorics and distributions of partial injections, p.161
    • Download Full Text (302Kb pdf)
  • Sabine Klinkenberg and Lutz Volkmann
    • On the order of almost regular graphs without a matching of given size, p.187
    • Download Full Text (152Kb pdf)
  • Richard M. Low and Sin-Min Lee
    • On the integer-magic spectra of tessellation graphs, p.195
    • Download Full Text (509Kb pdf)
  • Kevin K. Ferland and Megan L. Holben
    • The tough sets for the generalized Petersen graphs $G(n,2)$, p.211
    • Download Full Text (370Kb pdf)
  • L. F. Fitina and S. P. Lal
    • Access schemes based on perfect critical set partitions and transformations, p.229
    • Download Full Text (150Kb pdf)
  • Yongqiang Zhao and Wenjie He
  • J. Richard Lundgren, K. B. Reid, Simone Severini and Dustin J. Stewart
    • Quadrangularity and strong quadrangularity in tournaments, p.247
    • Download Full Text (223Kb pdf)
  • David R. Wood
    • Characterisations of intersection graphs by vertex orderings, p.261
    • Download Full Text (199Kb pdf)
  • R. Craigen
    • Products and factorizations of ternary complementary pairs, p.269
    • Download Full Text (198Kb pdf)
  • Shannon L. Fitzpatrick, Jeannette Janssen and Richard J. Nowakowski
  • Midori Kobayashi and Gisaku Nakamura
    • Uniform coverings of 2-paths with 6-cycles in the complete graph, p.299
    • Download Full Text (157Kb pdf)
  • Bert L. Hartnell and Douglas F. Rall
  • Shang-Wang Tan and Ji-Ming Guo
  • Ying Zhao, Yejing Wang and Jennifer Seberry
  • Jun Fujisawa and Katsuhiro Ota
  • Joanna Raczek
    • Lower bound on the paired domination number of a tree, p.343
    • Download Full Text (138Kb pdf)