The Australasian Journal of Combinatorics

Volume 19 (1999)

• Jianguo Qian
  • Two classes of extreme graphs related to the maximum degree of an interchange graph, pp.3–10

  ---

• Wei Fuyi, Chu Maoquan and Wang Jianzhong
  • On odd primitive graphs, pp.11–15

  ---

• Nirmala Achuthan, N.R. Achuthan and L. Caccetta
  • On the vertex arboricity of graphs with prescribed size, pp.17–36

  ---

• Dachang Guo
  • Isomorphisms and normality of Cayley digraphs of $A_5$, pp.37–45

  ---

• Justyna Kurkowiak
  • On disjoint perfect tree-matchings in random graphs, pp.47–54

  ---

• G.B. Khosrovshahi, H.R. Maimani and R. Torabi
  • Classification of simple 2-(6,3) and 2-(7,3) trades, pp.55–72

  ---

• Andrej Zlatoš
  • The diameter of lifted digraphs, pp.73–82

  ---

• Li Guojun and Chen Chuanping
  • Disjoint Hamiltonian cycles in graphs, pp.83–89

  ---

• Su Wenlong, Luo Haipeng, Zhang Zhengyou and Li Guiqing
  • New lower bounds of fifteen classical Ramsey numbers, pp.91–99

  ---

• Tim Penttila and Ivano Pinneri
  • Hyperovals, pp.101–114

  ---

• Hong Wang
  • Covering a bipartite graph with cycles passing through given edges, pp.115–121

  ---

• Chin-Lin Shiue
  • The $\alpha$-labeling number of bipartite graphs, pp.123–128

  ---

• Bolian Liu and Zhou Bo
  • Estimates on strict Hall exponents, pp.129–135

  ---

• Charlie H. Cooke and Iem Heng
  • On the non-existence of some generalized Hadamard matrices, pp.137–148

  ---

• Michael E. Raines and Zsuzsanna Szaniszló
  • Equitable partial cycle systems, pp.149–156

  ---

• Michael J. Plantholt and Shailesh K. Tipnis
  • On the list chromatic index of nearly bipartite multigraphs, pp.157–170

  ---

• Jay S. Bagga, Lowell W. Beineke and Badri N. Varma
  • Independence and cycles in super line graphs, pp.171–178

  ---

• E.S. Mahmoodian, Nasrin Soltankhah and Anne Penfold Street
  • On defining sets of directed designs, pp.179–190

  ---

• Yu-Bin Gao and Yan-Ling Shao
  • The $k$th upper generalized exponent set for the class of non-symmetric primitive matrices, pp.191–201

  ---

• Jing Huang
  • Which digraphs are round?, pp.203–208

  ---

• L.F. Fitina, Jennifer Seberry and Dinesh Sarvate
  • On $F$-squares and their critical sets, pp.209–230

  ---

• Zhou Guofei and Zhang Kemin
  • A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian, pp.231–234

  ---

• T. Aaron Gulliver
  • An extremal type I self-dual code of length 16 over ${\Bbb F}_2+u{\Bbb F}_2$, pp.235–238

  ---

• Z. Eslami and B. Tayfeh-Rezaie
  • On 2-$(v,3)$ trades of minimum volume, pp.239–251

  ---

• Neil P. Carnes, Anne Dye and James F. Reed
  • Bicyclic antiautomorphisms of directed triple systems with 0 or 1 fixed points, pp.253–258

  ---

• Aung Kyaw
  • A counterexample to a conjecture of Jackson and Wormald, pp.259–260

  ---

• M. Kouider and Z. Lonc
  • Path decompositions and perfect path double covers, pp.261–274

  ---

• B. Du
  • $\overrightarrow{P_3}$-factorization of complete bipartite symmetric digraphs, pp.275–278

  ---

• P. Mark Kayll
  • Asymptotics of the total chromatic number for multigraphs, pp.279–281

  ---

• Gaetano Quattrocchi
  • Blocking sets in balanced path designs, pp.283–286

  ---

• Michael S. Jacobson, André E. Kézdy and Jenő Lehel
  • Scenic graphs II: non-traceable graphs, pp.287–307

  ---