The Australasian Journal of Combinatorics

Volume 30 (2004)

• F.M. Dong, M.D. Hendy, K.L. Teo, and C.H.C. Little
  • Graph-functions associated with an edge-property, pp.3–20

  ---

• Alexander L. Strehl
  • Ternary codes through ternary designs, pp.21–29

  ---

• Erfang Shan, Liying Kang, and Michael A. Henning
  • A characterization of trees with equal total domination and paired-domination numbers, pp.31–39

  ---

• Jun-Ming Xu and Qi Liu
  • $2$-restricted edge connectivity of vertex-transitive graphs, pp.41–49

  ---

• Dingjun Lou and Dongning Rao
  • Characterizing factor critical graphs and an algorithm, pp.51–56

  ---

• R. Julian R. Abel, Iliya Bluskov, and Malcolm Greig
  • Balanced incomplete block designs with block size~9: Part III, pp.57–73

  ---

• Eric S. Egge and Toufik Mansour
  • 231-Avoiding involutions and Fibonacci numbers, pp.75–84

  ---

• Yunqing Xu
  • On frame self-orthogonal Latin squares of type $h^m1^n$, pp.85–93

  ---

• A.V. Kelarev
  • Labelled Cayley graphs and minimal automata, pp.95–101

  ---

• Ou Jianping
  • 4-restricted edge cuts of graphs, pp.103–112

  ---

• A. F. Beardon
  • The maximum degree in a vertex-magic graph, pp.113–116

  ---

• A. F. Beardon
  • Magic labellings of infinite graphs, pp.117–132

  ---

• Rajendra M. Pawale
  • Quasi-symmetric 3-designs with a fixed block intersection number, pp.133–140

  ---

• Fei Tan and Haidong Wu
  • On contractible edges in 3-connected graphs, pp.141–146

  ---

• P. Afshani, H. Hatami, and E.S. Mahmoodian
  • On the spectrum of the forced matching number of graphs, pp.147–160

  ---

• Jennifer A. Bruce and Mark E. Watkins
  • Concentric Bilinski diagrams, pp.161–174

  ---

• Qiang Li and Yanxun Chang
  • Decomposition of lambda-fold complete graphs into a certain five-vertex graph, pp.175–182

  ---

• Eric Gottlieb and Kennan Shelton
  • Color-induced subgraphs of Grünbaum colorings of triangulations of the sphere, pp.183–192

  ---

• Michael D. Hirschhorn and James A. Sellers
  • A different view of $m$-ary partitions, pp.193–196

  ---

• Benny Pinontoan and R. Bruce Richter
  • Crossing numbers of sequences of graphs I: general tiles, pp.197–206

  ---

• Toufik Mansour
  • A formula for the generating functions of powers of Horadam's sequence, pp.207–212

  ---

• M. Liang
  • Doubly equivalent designs, pp.213–222

  ---

• Tomoki Nakamigawa and Mamoru Watanabe
  • Separating pairs of points in the plane by monotone subsequences, pp.223–227

  ---

• Qingde Kang, Huijuan Zuo, and Yanfang Zhang
  • Decompositions of $\lambda K_v$ into $k$-circuits with one chord, pp.229–246

  ---

• Linfan Mao and Yanpei Liu
  • A new approach for enumerating maps on orientable surfaces, pp.247–259

  ---

• Guangfeng Jiang and Jianming Yu
  • Supersolvability of complementary signed-graphic hyperplane arrangements, pp.261–276

  ---

• E. Martínez-Moro, J. Mozo-Fernández, and C. Munuera
  • Compounding secret sharing schemes, pp.277–290

  ---

• Haixing Zhao, Ruying Liu, Xueliang Li, and Ligong Wang
  • On properties of adjoint polynomials of graphs and their applications, pp.291–306

  ---

• Michael D. Hirschhorn and James A. Sellers
  • Partitions into three triangular numbers, pp.307–318

  ---

• Ken Finlayson and Jennifer Seberry
  • Orthogonal designs from negacyclic matrices, pp.319–330

  ---