The Australasian Journal of Combinatorics

Volume 27 (2003)

• Nirmala Achuthan and A. Ramachandra Rao
  • On the number of cut edges in a regular graph, pp.5–12

  ---

• M.H. Armanious
  • Semi-planar Steiner quasigroups of cardinality $3n$, pp.13–21

  ---

• Angelika Hellwig and Lutz Volkmann
  • Maximally edge-connected digraphs, pp.23–32

  ---

• Gábor Bacsó, Zsolt Tuza and Vitaly Voloshin
  • Unique colorings of bi-hypergraphs, pp.33–45

  ---

• J.A. Bate and G.H.J. van Rees
  • Minimal and near-minimal critical sets in back-circulant latin squares, pp.47–61

  ---

• W. Duckworth
  • Maximum 2-independent sets of random cubic graphs, pp.63–79

  ---

• Zai-Ping Lu and Ming-Yao Xu
  • On the normality of Cayley graphs of order $pq$, pp.81–93

  ---

• Igor É. Zverovich
  • The Domination number of $(K_p, P_5)$-free graphs, pp.95–100

  ---

• Chunhui Lai
  • Graphs without repeated cycle lengths, pp.101–105

  ---

• Sharlene M. Andrijich and Louis Caccetta
  • The ambiguity problem arising in multisensor data association, pp.107–127

  ---

• V. Linek
  • Extending Skolem sequences, how can you begin?, pp.129–137

  ---

• Mekkia Kouider and Preben Dahl Vestergaard
  • On even $[2,b]$-factors in graphs, pp.139–147

  ---

• Gregory Gutin and Anders Yeo
  • Assignment problem based algorithms are impractical for the generalized TSP, pp.149–153

  ---

• D. Wu
  • Optimal holey packing OHP$_{4}(2,4,v,2)$ for $v\equiv 2 \ ({\rm mod} \ 3)$, pp.155–162

  ---

• Kung-Kuen Tse
  • On the Ramsey number of the quadrilateral versus the book and the wheel, pp.163–167

  ---

• Zhang Gengsheng and Wang Kaishun
  • Some results on $2$-homogeneous graphs, pp.169–173

  ---

• Vadim E. Zverovich
  • On the differences of the independence, domination and irredundance parameters of a graph, pp.175–185

  ---

• Tom C. Brown, Allen R. Freedman and Peter Jau-Shyong Shiue
  • Progressions of squares, pp.187–192

  ---

• T.C. Brown, Wun-Seng Chou and Peter J.-S. Shiue
  • On the partition function of a finite set, pp.193–204

  ---

• Charles J. Colbourn, Gaetano Quattrocchi and Alexander Rosa
  • Resolving $P(v,3,\lambda)$ designs into regular $P_3$-configurations, pp.205–212

  ---

• Spencer P. Hurd and Dinesh G. Sarvate
  • Embeddings and faithful enclosings of GDDs with a constant number of groups, pp.213–222

  ---

• Lutz Volkmann and Stefan Winzen
  • Cycles through a given arc in almost regular multipartite tournaments, pp.223–245

  ---

• Midori Kobayashi, Gisaku Nakamura and Chie Nara
  • Uniform coverings of 2-paths with 5-paths in $K_{2n}$, pp.247–252

  ---

• Daniel Král'
  • A counter-example to Voloshin's hypergraph co-perfectness conjecture, pp.253–261

  ---

• Tianbing Xia, Mingyuan Xia and Jennifer Seberry
  • Regular Hadamard matrix, maximum excess and SBIBD, pp.263–275

  ---

• S.M. Hegde and Sudhakar Shetty
  • On magic graphs, pp.277–284

  ---

• Robin Chapman
  • Partition identities arising from involutions, pp.285–291

  ---

• M.M.M. Jaradat
  • On the basis number of the direct product of graphs, pp.293–306

  ---

• Dan Archdeacon, Dalibor Fronček, Robert Jajcay, Zdeněk Ryjáček and Jozef Širáň
  • Regular clique covers of graphs, pp.307–316

  ---