The Australasian Journal of Combinatorics

Volume 39 (2007)

D.J. Ashe, David Leach and C.A. Rodger
- 2-Regular leaves of partial 8-cycle systems, pp.3–17
Tiffany Rose Andrus and Neil P. Carnes
- A class of antiautomorphisms of Mendelsohn triple systems with two cycles, pp.19–25
Lingli Sun
- The Erdős-Sós conjecture for spiders of diameter 9, pp.27–37
Ilias S. Kotsireas and Christos Koukouvinos
- Orthogonal designs of order 32 and 64 via computational algebra, pp.39–48
A. Sapounakis, I. Tasoulas and P. Tsikouras
- Some strings in Dyck paths, pp.49–72
Mieko Yamada
- Supplementary difference sets constructed from $(q+1)$st cyclotomic classes in GF$(q^2)$, pp.73–87
Grady Bullington, Linda Eroh, Kevin McDougal, Hosien Moghadam and Steven J. Winters
- Path and cycle decomposition numbers, pp.89–102
Narong Punnim
- Interpolation theorems in jump graphs, pp.103–114
Tatjana Gerzen and Bert Randerath
- Factoring logic functions using star-colorings, pp.115–127
Clay Culver and David Leach
- Equivalence classes of 5-bit Gray codes, pp.129–134
Richard H. Hammack
- Fractional graphs, pp.135–140
Veerle Fack and Brendan D. McKay
- A generalized switching method for combinatorial estimation, pp.141–154
Yunjian Wu and Qinglin Yu
- Uniform star-factors of graphs with girth three, pp.155–161
T. Aaron Gulliver, Masaaki Harada and Hiroki Miyabayashi
- Optimal double circulant self-dual codes over \mathbb{F}_4$ II, pp.163–174
Xuelian Wen and Dingjun Lou
- Path decomposition of defect 1-extendable bipartite graphs, pp.175–182
Tomáš Vetrík
- Factorization of complete graphs into three factors with the smallest diameter equal to 3 or 4, pp.183–190
Chengmin Wang
- Resolvable holey group divisible designs with block size three, pp.191–206
Sasha Logan Jarrell and C.A. Rodger
- Maximal sets of Hamilton cycles in complete multipartite graphs II, pp.207–217
Mostafa Blidia, Mustapha Chellali, Frédéric Maffray, Julien Moncel and Ahmed Semri
- Locating-domination and identifying codes in trees, pp.219–232
Sascha Kurz and Reinhard Laue
- Bounds for the minimum diameter of integral point sets, pp.233–240
G.R. Vijayakumar
- Partitions of the edge set of a graph into internally disjoint paths, pp.241–245
Ian M. Wanless
- A computer enumeration of small latin trades, pp.247–258
Antonio Bernini and Luca Ferrari
- Order properties of the Motzkin and Schroder families, pp.259–272
Elie Feder and David Garber
- Towards the computation of the convex hull of a configuration from its corresponding separating matrix, pp.273–282
S. Arumugam, K. Jacob and Lutz Volkmann
- Total and connected domination in digraphs, pp.283–292
T.W. Cusick, H. Fredricksen and P. Stănică
- On the delta sequence of the Thue-Morse sequence, pp.293–300
Dirk Meierling and Lutz Volkmann
- On the number of nonseparating vertices in strongly connected local tournaments, pp.301–315