Australasian Journal of CombinatoricsDean G. Hoffman and Matt Walsh,
Bipartite graphs with even spanning trees, p.3
Jun-Ming Xu, Meijie Ma and Zhengzhong Du,
Edge-fault-tolerant properties of hypercubes and folded hypercubes, p.7
Doost Ali Mojdeh, Nader Jafari Rad and A. Khodkar,
The defining numbers for vertex colorings of certain graphs, p.17
Joanna A. Ellis-Monaghan, David A. Pike and Yubo Zou,
Decycling of Fibonacci cubes, p.31
A. Aberkane, V. Linek and S.J. Mor,
On the powers in the Thue-Morse word, p.41
A.F. Beardon,
The average degree in a vertex-magic graph, p.51
Masaaki Harada and Hadi Kharaghani,
Orthogonal designs and MDS self-dual codes, p.57
E.S. Mahmoodian, Behnaz Omoomi and Y.H. Peng,
On the defining sets of some special graphs, p.69
Ken Finlayson, Moon Ho Lee, Jennifer Seberry and Mieko Yamada,
Jacket matrices constructed from Hadamard matrices and generalized Hadamard matrices, p.83
J.-L. Baril, H. Kheddouci and O. Togni,
Adjacent vertex distinguishing edge-colorings of meshes, p.89
Xuebin Zhang,
Construction for an OGDD of type $24^{4}$, p.103
Peter Adams and Darryn Bryant,
Two-factorisations of complete graphs of orders fifteen and seventeen, p.113
M. Abreu, M. Funk, D. Labbate and V. Napolitano,
On (minimal) regular graphs of girth $6$, p.119
Beate K"{u}pper and Lutz Volkmann,
Upper bounds on the domination number of a graph in terms of order, diameter and minimum degree, p.133
Laura Harris, Johannes H. Hattingh and Michael A. Henning,
Total $k$-subdominating functions on graphs, p.141
Narong Punnim,
Decycling connected regular graphs, p.155
X. Li, Q. Shu and D. Wu,
Generalized Steiner systems $GS_5(2,5,v,5)$, p.171
Alberto M. Teguia and Anant P. Godbole,
Sierpi\'nski gasket graphs and some of their properties, p.181
D. Combe and A.M. Nelson,
Magic labellings of infinite graphs over infinite groups., p.193
Wenjie He, Yufa Shen, Yongqiang Zhao, Yanning Wang and Xinmiao Ma,
On property $M(3)$ of some complete multipartite graphs, p.211
David E. Brown and J. Richard Lundgren,
Bipartite probe interval graphs, circular arc graphs, and interval point bigraphs, p.221
Shinya Fujita, Hajime Matsumura, Masao Tsugaki and Tomoki Yamashita,
Degree sum conditions and vertex-disjoint cycles in a graph, p.237
M. Bav{c}a and M. Murugan,
Super edge-antimagic labeling of a cycle with a chord, p.253
Jason Cousineau, Ilias S. Kotsireas and Christos Koukouvinos,
Genetic algorithms for orthogonal designs, p.263
Dorota Br'od and Zdzis{l}aw Skupie'n,
Trees with extremal numbers of dominating sets, p.273
Anna Llad'o and F.A. Muntaner-Batle,
Any tree is a large subgraph of a magic tree, p.291
M.E. Gaston, M. Kraetzl and W.D. Wallis,
Using graph diameter for change detection in dynamic networks, p.299
Akira Saito,
Contractible edges and removable edges in a graph with large minimum degree, p.313
E.J. Cockayne and C.M. Mynhardt,
A lower bound for the depression of trees, p.319
Daniel Kr'al', Li-Da Tong and Xuding Zhu,
Upper hamiltonian numbers and hamiltonian spectra of graphs, p.329
Robert E. Jamison and Gaetano Quattrocchi,
Partial $S(k-1,k,v)$'s inducing $P_k$-decompositions of $K_v$, p.341