## Volume 31 (2005)

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

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

- Anders Sune Pedersen
- A. Lladó and S.C. López Masip
- Lutz Volkman and Stefan Winzen
- Petros Hadjicostas and K.B. Lakshmanan
- Bubble sort with erroneous comparisons, pp.85–106

- Mária Ipolyiová
- Lutz Volkmann
- 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.P. Burger, E.J. Cockayne and C.M. Mynhardt
- S. Bonvicini and G. Rinaldi
- 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
- Steven T. Dougherty, Manish K. Gupta and Keisuke Shiromoto
- Weigen Yan and Fuju Zhang
- Indices of convergence on four digraph operators, pp.249–262

- Manish K. Gupta
- 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
- Manouchehr Zaker
- Darryn Bryant, C.D. Leach and C.A. Rodger
- Steven T. Dougherty