The Australasian Journal of Combinatorics

Volume 44 (2009)

• M.D. Atkinson, H.P. van Ditmarsch and S. Roehling
  • Avoiding bias in cards cryptography, pp.3–17

  ---

• Ying Zhao, Jennifer Seberry, Tianbing Xia, Beata j. Wysocki and Tadeusz A. Wysocki
  • Construction of amicable orthogonal design, pp.19–35

  ---

• Lei Yi and Baoyindureng Wu
  • The transformation graph $G^{++-}$, pp.37–42

  ---

• E. Duchêne, A.S. Fraenkel, S. Gravier and R.J. Nowakowski
  • Another bridge between Nim and Wythoff, pp.43–56

  ---

• Jana Tomanová
  • A note on orbit graphs of finite groups and colour-clique graphs of Cayley graphs, pp.57–62

  ---

• Italo J. Dejter
  • On $\{K_4,K_{2,2,2}\}$ ultrahomogeneity, pp.63–75

  ---

• Bernard Lidický
  • On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles, pp.77–86

  ---

• Andrzej Żak
  • A note on perfect dissections of an equilateral triangle, pp.87–93

  ---

• Peter Adams, James Lefevre and Mary Waterhouse
  • On 2-perfect cube decompositions, pp.95–103

  ---

• Klas Markström
  • A note on uniquely pancyclic graphs, pp.105–110

  ---

• Chau Yuen, Yong Liang Guan and Tjeng Thiang Tjhung
  • Amicable complex orthogonal designs, pp.111–121

  ---

• Dirk Meierling
  • On the number of nonseparating vertices in strongly connected in-tournaments, pp.123–152

  ---

• Hong-Hai Li and Jiong-Sheng Li
  • Note on the normalized Laplacian eigenvalues of signed graphs, pp.153–162

  ---

• G.R. Omidi
  • On graphs with largest Laplacian eigenvalue at most 4, pp.163–170

  ---

• Mahdieh Hasheminezhad, S. Mehdi Hashemi and Maryam Tahmasbi
  • Ortho-radial drawings of graphs, pp.171–182

  ---

• G.H.J. van Rees
  • More greedy defining sets in Latin squares, pp.183–198

  ---

• Jocelyn Quaintance
  • Symmetrically inequivalent partitions of a square array: part II, pp.199–223

  ---

• Dianhua Wu, Jianxiao Yang, Shuming Chen and Desheng Li
  • The existence of $(v,4,\lambda)$ disjoint difference families, pp.225–234

  ---

• R.E.L. Aldred, Jun Fujisawa and Akira Saito
  • Two forbidden subgraphs and the existence of a 2-factor in graphs, pp.235–246

  ---

• Adriana Hansberg and Lutz Volkmann
  • A characterization of even order trees with domination number half their order minus one., pp.247–254

  ---

• Øystein J. Rødseth and James A. Sellers
  • Congruences modulo high powers of 2 for Sloane's box stacking function, pp.255–263

  ---

• Ghidewon Abay-Asmerom, Richard H. Hammack and Dewey T. Taylor
  • Factorial properties of graphs, pp.265–272

  ---

• Gary Chartrand, Futaba Okamoto and Ping Zhang
  • The metric chromatic number of a graph, pp.273–286

  ---

• Chelsea Sackett and Maria Axenovich
  • Avoiding rainbow induced subgraphs in edge-colorings, pp.287–296

  ---

• Mostafa Blidia and Widad Dali
  • A characterization of locating-domination edge critical graphs, pp.297–300

  ---

• Steve Wright
  • Some enumerative combinatorics arising from a problem on quadratic nonresidues, pp.301–315

  ---