The Australasian Journal of Combinatorics

Volume 34 (2006)

• Lubica Liskova
  • Cayley maps with given exponents and distribution of inverses, pp.3–15

  ---

• Gregory Gutin and Arash Rafiey
  • Multipartite tournaments with small number of cycles, pp.17–21

  ---

• Irene Charon, Olivier Hudry and Antoine Lobstein
  • Possible cardinalities for locating-dominating codes in graphs, pp.23–31

  ---

• Xuebin Zhang
  • Compatibly ordered Room squares, pp.33–40

  ---

• Richard M. Low and Sin-Min Lee
  • On the products of group-magic graphs, pp.41–48

  ---

• Tan Xuezhong and Liu Bolian
  • On the spectrum of the quasi-laplacian matrix of a graph, pp.49–55

  ---

• V. V. Lozin and D. Rautenbach
  • The tree- and clique-width of bipartite graphs in special classes, pp.57–67

  ---

• K. M. Koh and E. G. Tay
  • On optimal orientations of tree vertex-multiplications, pp.69–87

  ---

• Peter Abramenko and Hendrik Van Maldeghem
  • Combinatorial characterizations of convexity and apartments in buildings, pp.89–104

  ---

• Tianbing Xia, Mingyuan Xia, Jennifer Seberry and Jing Wu
  • Hadamard matrices constructed by circulant and negacyclic matrices, pp.105–116

  ---

• S. Taylor, I. M. Wanless and N. L. Boland
  • Distance domination and amplifier placement problems, pp.117–136

  ---

• Ying Zhao, Beata J. Wysocki, Tadeusz A. Wysocki and Le Chung Tran
  • Amicable orthogonal designs of order 8 for complex space-time block codes, pp.137–144

  ---

• Peter Adams, Darryn Bryant, Mike Grannell and Terry Griggs
  • Diagonally switchable 4-cycle systems, pp.145–152

  ---

• Doostali Mojdeh
  • On conjectures on the defining set of (vertex) graph colourings, pp.153–160

  ---

• Olexandr Ganyushkin and Volodymyr Mazorchuk
  • Combinatorics and distributions of partial injections, pp.161–186

  ---

• Sabine Klinkenberg and Lutz Volkmann
  • On the order of almost regular graphs without a matching of given size, pp.187–194

  ---

• Richard M. Low and Sin-Min Lee
  • On the integer-magic spectra of tessellation graphs, pp.195–210

  ---

• Kevin K. Ferland and Megan L. Holben
  • The tough sets for the generalized Petersen graphs $G(n,2)$, pp.211–228

  ---

• L. F. Fitina and S. P. Lal
  • Access schemes based on perfect critical set partitions and transformations, pp.229–237

  ---

• Yongqiang Zhao and Wenjie He
  • Note on competition and phylogeny numbers, pp.239–246

  ---

• J. Richard Lundgren, K. B. Reid, Simone Severini and Dustin J. Stewart
  • Quadrangularity and strong quadrangularity in tournaments, pp.247–260

  ---

• David R. Wood
  • Characterisations of intersection graphs by vertex orderings, pp.261–268

  ---

• R. Craigen
  • Products and factorizations of ternary complementary pairs, pp.269–280

  ---

• Shannon L. Fitzpatrick, Jeannette Janssen and Richard J. Nowakowski
  • Fractional isometric path number, pp.281–298

  ---

• Midori Kobayashi and Gisaku Nakamura
  • Uniform coverings of 2-paths with 6-cycles in the complete graph, pp.299–304

  ---

• Bert L. Hartnell and Douglas F. Rall
  • On graphs having uniform size star factors, pp.305–311

  ---

• Shang-Wang Tan and Ji-Ming Guo
  • The second largest eigenvalue of trees, pp.313–320

  ---

• Ying Zhao, Yejing Wang and Jennifer Seberry
  • On amicable orthogonal designs of order 8, pp.321–329

  ---

• Jun Fujisawa and Katsuhiro Ota
  • Weighted Ramsey problem, pp.331–342

  ---

• Joanna Raczek
  • Lower bound on the paired domination number of a tree, pp.343–347

  ---