The Australasian Journal of Combinatorics

Volume 24 (2001)

• Anton Černý
  • On maximal premature partial Latin squares, pp.5–12

  ---

• Xiuling Shan, Qingde Kang and Qiujie Sun
  • Self-converse Mendelsohn designs with odd block size, pp.13–33

  ---

• D.R.B. Burgess and A.D. Keedwell
  • Weakly completable critical sets for proper vertex and edge colourings of graphs, pp.35–45

  ---

• Lane Clark
  • The strong matching number of a random graph, pp.47–57

  ---

• Lucia Gionfriddo
  • On the spectrum of nested $G$-designs, where $G$ has four non-isolated vertices or less, pp.59–80

  ---

• Haipeng Luo, Wenlong Su and Yun-Qiu Shen
  • New lower bounds of ten classical Ramsey numbers, pp.81–90

  ---

• G. MacGillivray and K. Seyffarth
  • Classes of line graphs with small cycle double covers, pp.91–114

  ---

• Karen G. Harris
  • The intersection problem for graphs with six vertices, six edges and a 4-cycle subgraph, pp.115–121

  ---

• Chunhui Lai
  • A note on potentially $K_4-e$ graphical sequences, pp.123–127

  ---

• W. Ananchuen
  • On the adjacency properties of generalized Paley graphs, pp.129–147

  ---

• W. Ananchuen
  • A note on constructing digraphs with prescribed properties, pp.149–155

  ---

• Wang Weifan and Ko-Wei Lih
  • The 4-choosability of planar graphs without 6-cycles, pp.157–164

  ---

• Ken-ichi Kawarabayashi
  • Note on $k$-contractible edges in $k$-connected graphs, pp.165–168

  ---

• Caikun Liu, Qingde Kang and Zhifen Guo
  • Self-converse Mendelsohn designs with block size $6q$, pp.169–192

  ---

• Michael Albert, R.E.L. Aldred and Derek Holton
  • On $3^*$-connected graphs, pp.193–207

  ---

• S.I. El-Zanati, C. Vanden Eynden and Narong Punnim
  • On the cyclic decomposition of complete graphs into bipartite graphs, pp.209–219

  ---

• Andrew Blinco
  • On diagonal cycle systems, pp.221–230

  ---

• A.P. Burger, C.M. Mynhardt and E.J. Cockayne
  • Queens graphs for chessboards on the torus, pp.231–246

  ---

• Dingjun Lou, Lihua Teng and Xiangjun Wu
  • A polynomial algorithm for cyclic edge connectivity of cubic graphs, pp.247–259

  ---

• Geoffrey Exoo
  • A trivalent graph of girth 17, pp.261–264

  ---

• Jiping Liu and Cheng Zhao
  • On a conjecture of Hilton, pp.265–274

  ---

• D. Combe, W.D. Palmer and W.R. Unger
  • Bhaskar Rao designs and the alternating group $A_4$, pp.275–283

  ---

• Michael D. Hirschhorn
  • On partitions into four distinct squares of equal parity, pp.285–291

  ---

• Brendan D. McKay and Edward Spence
  • Classification of regular two-graphs on 36 and 38 vertices, pp.293–300

  ---

• Midori Kobayashi and Gisaku Nakamura
  • Uniform coverings of 2-paths by 4-paths, pp.301–304

  ---

• Ioan Tomescu
  • The number of $h$-strongly connected digraphs with small diameter, pp.305–311

  ---

• E. Ballico and A. Cossidente
  • Finite field Nullstellensatz and Grassmannians, pp.313–315

  ---