The Australasian Journal of Combinatorics

Volume 35 (2006)

• Dean G. Hoffman and Matt Walsh
  • Bipartite graphs with even spanning trees, pp.3–6

  ---

• Jun-Ming Xu, Meijie Ma and Zhengzhong Du
  • Edge-fault-tolerant properties of hypercubes and folded hypercubes, pp.7–16

  ---

• Doost Ali Mojdeh, Nader Jafari Rad and A. Khodkar
  • The defining numbers for vertex colorings of certain graphs, pp.17–30

  ---

• Joanna A. Ellis-Monaghan, David A. Pike and Yubo Zou
  • Decycling of Fibonacci cubes, pp.31–40

  ---

• A. Aberkane, V. Linek and S.J. Mor
  • On the powers in the Thue-Morse word, pp.41–49

  ---

• A.F. Beardon
  • The average degree in a vertex-magic graph, pp.51–56

  ---

• Masaaki Harada and Hadi Kharaghani
  • Orthogonal designs and MDS self-dual codes, pp.57–67

  ---

• E.S. Mahmoodian, Behnaz Omoomi and Y.H. Peng
  • On the defining sets of some special graphs, pp.69–81

  ---

• Ken Finlayson, Moon Ho Lee, Jennifer Seberry and Mieko Yamada
  • Jacket matrices constructed from Hadamard matrices and generalized Hadamard matrices, pp.83–87

  ---

• J.-L. Baril, H. Kheddouci and O. Togni
  • Adjacent vertex distinguishing edge-colorings of meshes, pp.89–102

  ---

• Xuebin Zhang
  • Construction for an OGDD of type $24^{4}$, pp.103–112

  ---

• Peter Adams and Darryn Bryant
  • Two-factorisations of complete graphs of orders fifteen and seventeen, pp.113–118

  ---

• M. Abreu, M. Funk, D. Labbate and V. Napolitano
  • On (minimal) regular graphs of girth $6$, pp.119–132

  ---

• Beate Küpper and Lutz Volkmann
  • Upper bounds on the domination number of a graph in terms of order, diameter and minimum degree, pp.133–140

  ---

• Laura Harris, Johannes H. Hattingh and Michael A. Henning
  • Total $k$-subdominating functions on graphs, pp.141–154

  ---

• Narong Punnim
  • Decycling connected regular graphs, pp.155–169

  ---

• X. Li, Q. Shu and D. Wu
  • Generalized Steiner systems $GS_5(2,5,v,5)$, pp.171–179

  ---

• Alberto M. Teguia and Anant P. Godbole
  • Sierpiński gasket graphs and some of their properties, pp.181–192

  ---

• D. Combe and A.M. Nelson
  • Magic labellings of infinite graphs over infinite groups., pp.193–210

  ---

• Wenjie He, Yufa Shen, Yongqiang Zhao, Yanning Wang and Xinmiao Ma
  • On property $M(3)$ of some complete multipartite graphs, pp.211–220

  ---

• David E. Brown and J. Richard Lundgren
  • Bipartite probe interval graphs, circular arc graphs, and interval point bigraphs, pp.221–236

  ---

• Shinya Fujita, Hajime Matsumura, Masao Tsugaki and Tomoki Yamashita
  • Degree sum conditions and vertex-disjoint cycles in a graph, pp.237–251

  ---

• M. Bača and M. Murugan
  • Super edge-antimagic labeling of a cycle with a chord, pp.253–261

  ---

• Jason Cousineau, Ilias S. Kotsireas and Christos Koukouvinos
  • Genetic algorithms for orthogonal designs, pp.263–272

  ---

• Dorota Bród and Zdzisław Skupień
  • Trees with extremal numbers of dominating sets, pp.273–290

  ---

• Anna Lladó and F.A. Muntaner-Batle
  • Any tree is a large subgraph of a magic tree, pp.291–297

  ---

• M.E. Gaston, M. Kraetzl and W.D. Wallis
  • Using graph diameter for change detection in dynamic networks, pp.299–311

  ---

• Akira Saito
  • Contractible edges and removable edges in a graph with large minimum degree, pp.313–318

  ---

• E.J. Cockayne and C.M. Mynhardt
  • A lower bound for the depression of trees, pp.319–328

  ---

• Daniel Král', Li-Da Tong and Xuding Zhu
  • Upper hamiltonian numbers and hamiltonian spectra of graphs, pp.329–340

  ---

• Robert E. Jamison and Gaetano Quattrocchi
  • Partial $S(k-1,k,v)$'s inducing $P_k$-decompositions of $K_v$, pp.341–348

  ---