The Australasian Journal of Combinatorics

Volume 37 (2007)

• Aung Kyaw
  • A sufficient condition for spanning trees with bounded maximum degree in a graph, pp.3–10

  ---

• Haixing Zhao, Xueliang Li and Ruying Liu
  • Chromaticity of the Complements of Some Sparse Graphs, pp.11–20

  ---

• Gang Chen
  • A note on potentially $K_{1,1,t}$-graphic sequences, pp.21–26

  ---

• Shengjia Li, Ruijuan Li and Jinfeng Feng
  • The graphs satisfying conditions of Ore's type, pp.27–31

  ---

• S. Akbari, O. Etesami, H. Mahini and M. Mahmoody
  • On rainbow cycles in edge colored complete graphs, pp.33–42

  ---

• M.H. Albert, R.E.L. Aldred, M.D. Atkinson, M.D. van Ditmarsch, C.C. Handley, D.A. Holton and D.J. McCaughan
  • Compositions of pattern restricted sets of permutations, pp.43–56

  ---

• Agnieszka Görlich, Rafał Kalinowski, Mariusz Meszka, Monika Pilśniak and Mariusz Woźniak
  • A note on decompositions of transitive tournaments II, pp.57–66

  ---

• Magdalena Lemańska
  • Lower bound on the weakly connected domination number of a tree, pp.67–71

  ---

• Andrea Vietri
  • On certain 2-rotational cycle systems of complete graphs, pp.73–79

  ---

• Aihong Wu
  • Large sets of disjoint directed and Mendelsohn packing triple systems on $6k+5$ points, pp.81–88

  ---

• Edward Dobson
  • Packing trees of bounded diameter into the complete graph, pp.89–100

  ---

• Arthur T. Benjamin and Michael D. Hirschhorn
  • A combinatorial solution to intertwined recurrences, pp.101–116

  ---

• Tianbing Xia, Mingyuan Xia and Jennifer Seberry
  • Some new results of regular Hadamard matrices and SBIBD II, pp.117–125

  ---

• Vito Napolitano
  • Note: A new proof of an inequality for finite planar spaces, pp.127–130

  ---

• Abdollah Khodkar and S.M. Sheikholeslami
  • On perfect double dominating sets in grids cylinders and tori, pp.131–139

  ---

• R.J.R. Abel
  • Some new near resolvable BIBDs with $k=7$ and resolvable BIBDs with $k=5$, pp.141–146

  ---

• A. Cossidente and G. Marino
  • On certain group embeddings in cross characteristic, pp.147–154

  ---

• Alejandro Aguado, Saad I. El-Zanati, Heidi Hake, Jessica Stob and Hera Yayla
  • On $\rho$-labeling the union of three cycles, pp.155–170

  ---

• Andrea Vietri
  • Nice lists of differences, and their connections with algebraic properties of unitary polynomials, pp.171–185

  ---

• Stephan G. Wagner
  • On the average Wiener index of degree-restricted trees, pp.187–203

  ---

• Sarah K. Bleiler and John T. Saccoman
  • A correction in the formula for the number of spanning trees in threshold graphs, pp.205–213

  ---

• Chengde Wang
  • More R-sequenceable Groups, pp.215–224

  ---

• E.J. Cheon
  • On the upper bound of the minimum length of 5-dimensional linear codes, pp.225–232

  ---

• Jeff H. Dinitz, Alan C.H. Ling and Douglas R. Stinson
  • Perfect hash families from transversal designs, pp.233–242

  ---

• S. Arumugam and I. Sahul Hamid
  • Simple acyclic graphoidal covers in a graph, pp.243–255

  ---

• M. Esmaeili and T.A. Gulliver
  • On the [32,16,8] BCH and quadratic residue codes, pp.257–264

  ---

• Sizhong Zhou and Xiuqian Xuan
  • Complete-factors and $(g,f)$-covered graphs, pp.265–269

  ---

• Lingli Sun
  • On the Loebl-Komlós-Sós conjecture, pp.271–275

  ---

• K.A. Sugeng and J. Ryan
  • On several classes of monographs, pp.277–284

  ---

• R.S. Manikandan and P. Paulraja
  • $C_5$-decompositions of the tensor product of complete graphs, pp.285–293

  ---

• Dmitry Finozhenok and William D. Weakley
  • An improved lower bound for domination numbers of the Queen's graph, pp.295–300

  ---

• David Cariolaro
  • On the Ramsey number $R(3,6)$, pp.301–304

  ---

• Yi-Zheng Fan, Hai-Yan Hong, Shi-Cai Gong and Yi Wang
  • Order unicyclic mixed graphs by spectral radius, pp.305–316

  ---