The Australasian Journal of Combinatorics

Volume 31 (2005)

• Igor' E. Zverovich and Inessa I. Zverovich
  • Closure of $K_1 + 2K_2$-free graphs, pp.3–13

  ---

• Toufik Mansour
  • Squaring the terms of an $\ell^{\mbox{th}}$ order linear recurrence, pp.15–20

  ---

• Nathalie Bertrand, Irène Charon, Olivier Hudry and Antoine Lobstein
  • $1$-identifying codes on trees, pp.21–35

  ---

• Anders Sune Pedersen
  • On equality in Berge's classical bound for the domination number, pp.37–46

  ---

• A. Lladó and S.C. López Masip
  • Minimum tree decompositions with a given tree as a factor, pp.47–59

  ---

• Lutz Volkman and Stefan Winzen
  • Almost regular $c$-partite tournaments with $c \ge 8$ contain an $n$-cycle through a given arc for $4 \le n \le c$, pp.61–84

  ---

• Petros Hadjicostas and K.B. Lakshmanan
  • Bubble sort with erroneous comparisons, pp.85–106

  ---

• Mária Ipolyiová
  • The minimal polynomial of $2\cos \frac{\pi}{p}$ and its application to regular maps of large planar width, pp.107–117

  ---

• Lutz Volkmann
  • Complementary cycles in regular multipartite tournaments, pp.119–134

  ---

• Jessica Cuomo, Nkiruka Nwasokwa and Vadim Ponomarenko
  • Jump systems and laminated Manhattan sets, pp.135–143

  ---

• Vito Napolitano
  • On some finite linear spaces with few lines, pp.145–160

  ---

• Shu-Guang Guo
  • A conjecture on subset sums of a finite set of positive integers, pp.161–165

  ---

• A.P. Burger, E.J. Cockayne and C.M. Mynhardt
  • Altitude of small complete and complete bipartite graphs, pp.167–177

  ---

• S. Bonvicini and G. Rinaldi
  • Minkowski tangent-circle structures and key distribution patterns, pp.179–187

  ---

• Shinya Fujita
  • Vertex-disjoint copies of $K_4^-$ in graphs, pp.189–200

  ---

• Tomokazu Nagayama and Liang Zhang
  • Long cycles through specified edges and vertices, pp.201–216

  ---

• Atif Abueida, Wiebke S. Diestelkamp, Stephanie P. Edwards and Darren B. Parker
  • Determining properties of a multipartite tournament from its lattice of convex subsets, pp.217–230

  ---

• Steven T. Dougherty, Manish K. Gupta and Keisuke Shiromoto
  • On generalized weights for codes over ${\Bbb Z}_k$, pp.231–248

  ---

• Weigen Yan and Fuju Zhang
  • Indices of convergence on four digraph operators, pp.249–262

  ---

• Manish K. Gupta
  • On ${\Bbb Z}_{4}$ codes satisfying the chain condition, pp.263–272

  ---

• Marcel Abas
  • Triangular Cayley maps of $K_{n,n,n}$, pp.273–285

  ---

• Beiliang Du
  • Splitting balanced incomplete block designs, pp.287–298

  ---

• Hajo Broersma, Xueliang Li, Gerhard Woeginger and Shenggui Zhang
  • Paths and cycles in colored graphs, pp.299–311

  ---

• Ioan Tomescu
  • Almost all graphs and $h$-hypergraphs have small diameter, pp.313–323

  ---

• Manouchehr Zaker
  • Grundy chromatic number of the complement of bipartite graphs, pp.325–329

  ---

• Darryn Bryant, C.D. Leach and C.A. Rodger
  • Hamilton decompositions of complete bipartite graphs with a 3-factor leave, pp.331–336

  ---

• Steven T. Dougherty
  • A new construction of self-dual codes from projective planes, pp.337–348

  ---