Australasian Journal of CombinatoricsAustralasian Journal of CombinatoricsYuejian Peng,
A note on non-jumping numbers, p.3
M. E. Messinger,
Average firefighting on infinite grids, p.15
Hongtao Zhao and Yanfang Zhang,
Partitioning sets of oriented triples into the smallest nontrivial oriented triple systems, p.29
Peter Danziger and Chengmin Wang,
Resolvable modified group divisible designs with higher index, p.37
Bostjan Bresar and Simon Spacapan,
On the connectivity of the direct product of graphs, p.45
Andrew Beveridge and Oleg Pikhurko,
On the connectivity of extremal Ramsey graphs, p.57
Eyal Loz and Jozef Siran,
New record graphs in the degree-diameter problem, p.63
Tero Laihonen and Julien Moncel,
On graphs admitting $t$-ID codes, p.81
Jan Plesnik,
Examples of goal-minimally $k$-diametric graphs for some small values of $k$, p.93
Criel Merino,
On the number of tilings of the rectangular board with T-tetronimoes, p.107
Jocelyn Quaintance,
Letter representations of $n\times n\times p$ proper arrays, p.115
Dean Crnkovic,
A series of Siamese twin designs intersecting in a BIBD and a PBD, p.139
W. C. Shiu and Richard M. Low,
Ring-magic labelings of graphs, p.147
Kannan Balakrishnan, Manoj Changat, Sandi Klavzar, Joseph Mathews, Iztok Peterin, G. N. Prasanth and Simon Spacapan,
Antimedian graphs, p.159
D. Wu, Z. Chen and M. Cheng,
A note on the existence of balanced $(q,{3,4},1)$ difference families, p.171
C. A. Baker and J. D. A. Manzer,
Skolem-labeling of generalized three-vane windmills, p.175
Zeling Shao and Yanpei Liu,
Genus distributions of orientable embeddings for two types of graphs, p.205
Lutz Volkmann,
A characterization of bipartite graphs with independence number half their order, p.219
Henry Martyn Mulder, Michael J. Pelsmajer and K. B. Reid,
Axiomization of the center function on trees, p.223
Giuseppe Mazzuoccolo,
Perfect one-factorizations in line-graphs and planar graphs, p.227
I. S. Kotsireas and C. Koukouvinos,
New skew-Hadamard matrices via computational algebra, p.235
Adelaide Rose Merlyn Saldanha and S. Parameshwara Bhatta,
On counting $n$-element trellises having exactly one pair of noncomparable elements, p.249
Andrei Gagarin,
Improved upper bounds for the $k$-tuple domination number, p.257
Changping Wang,
The negative decision number in graphs, p.263
Andrea Vietri,
A new infinite family of graceful generalised Petersen graphs, via graceful collages again, p.273
V. Ch. Venkaiah and Kishore Kothapalli,
Anti-magic labellings of a class of planar graphs, p.283
H. Karami, S. M. Sheikholeslami and Abdollah Khodkar,
Signed edge majority domination numbers in graphs, p.291
D. A. Preece,
Daisy chains---a fruitful combinatorial concept, p.297