The Australasian Journal of Combinatorics

Volume 41 (2008)

• Yuejian Peng
  • A note on non-jumping numbers, pp.3–13

  ---

• M. E. Messinger
  • Average firefighting on infinite grids, pp.15–28

  ---

• Hongtao Zhao and Yanfang Zhang
  • Partitioning sets of oriented triples into the smallest nontrivial oriented triple systems, pp.29–35

  ---

• Peter Danziger and Chengmin Wang
  • Resolvable modified group divisible designs with higher index, pp.37–44

  ---

• Boštjan Brešar and Simon Špacapan
  • On the connectivity of the direct product of graphs, pp.45–56

  ---

• Andrew Beveridge and Oleg Pikhurko
  • On the connectivity of extremal Ramsey graphs, pp.57–61

  ---

• Eyal Loz and Jozef Širáň
  • New record graphs in the degree-diameter problem, pp.63–80

  ---

• Tero Laihonen and Julien Moncel
  • On graphs admitting $t$-ID codes, pp.81–91

  ---

• Ján Plesník
  • Examples of goal-minimally $k$-diametric graphs for some small values of $k$, pp.93–105

  ---

• Criel Merino
  • On the number of tilings of the rectangular board with T-tetronimoes, pp.107–114

  ---

• Jocelyn Quaintance
  • Letter representations of $n\times n\times p$ proper arrays, pp.115–137

  ---

• Dean Crnković
  • A series of Siamese twin designs intersecting in a BIBD and a PBD, pp.139–145

  ---

• W. C. Shiu and Richard M. Low
  • Ring-magic labelings of graphs, pp.147–158

  ---

• Kannan Balakrishnan, Manoj Changat, Sandi Klavžar, Joseph Mathews, Iztok Peterin, G. N. Prasanth and Simon Špacapan
  • Antimedian graphs, pp.159–170

  ---

• D. Wu, Z. Chen and M. Cheng
  • A note on the existence of balanced $(q,{3,4},1)$ difference families, pp.171–174

  ---

• C. A. Baker and J. D. A. Manzer
  • Skolem-labeling of generalized three-vane windmills, pp.175–204

  ---

• Zeling Shao and Yanpei Liu
  • Genus distributions of orientable embeddings for two types of graphs, pp.205–217

  ---

• Lutz Volkmann
  • A characterization of bipartite graphs with independence number half their order, pp.219–222

  ---

• Henry Martyn Mulder, Michael J. Pelsmajer and K. B. Reid
  • Axiomization of the center function on trees, pp.223–226

  ---

• Giuseppe Mazzuoccolo
  • Perfect one-factorizations in line-graphs and planar graphs, pp.227–233

  ---

• I. S. Kotsireas and C. Koukouvinos
  • New skew-Hadamard matrices via computational algebra, pp.235–248

  ---

• Adelaide Rose Merlyn Saldanha and S. Parameshwara Bhatta
  • On counting $n$-element trellises having exactly one pair of noncomparable elements, pp.249–256

  ---

• Andrei Gagarin
  • Improved upper bounds for the $k$-tuple domination number, pp.257–261

  ---

• Changping Wang
  • The negative decision number in graphs, pp.263–272

  ---

• Andrea Vietri
  • A new infinite family of graceful generalised Petersen graphs, via graceful collages again, pp.273–282

  ---

• K. Ramanjaneyulu, V. Ch. Venkaiah and Kishore Kothapalli
  • Anti-magic labellings of a class of planar graphs, pp.283–290

  ---

• H. Karami, S. M. Sheikholeslami and Abdollah Khodkar
  • Signed edge majority domination numbers in graphs, pp.291–296

  ---

• D. A. Preece
  • Daisy chains - a fruitful combinatorial concept, pp.297–316

  ---