The Australasian Journal of Combinatorics

Volume 26 (2002)

• Bert Randerath and Ingo Schiermeyer
  • A note on Brooks' theorem for triangle-free graphs, pp.3–9

  ---

• Gab-Byung Chae, Edgar M. Palmer and Wai-Cheong Siu
  • Geodetic number of random graphs of diameter 2, pp.11–20

  ---

• William Klostermeyer
  • Defective circular coloring, pp.21–32

  ---

• Xiao-Dong Zhang and Rong Luo
  • The spectral radius of triangle-free graphs, pp.33–39

  ---

• P. Polito and O. Polverino
  • Linear blocking sets in $PG(2,q^4)$, pp.41–48

  ---

• David R. Wood
  • On vertex-magic and edge-magic total injections of graphs, pp.49–63

  ---

• Midori Kobayashi, Nobuaki Mutoh, Kiyasu-Zen'iti and Gisaku Nakamura
  • Double Dudeney sets for an odd number of vertices, pp.65–83

  ---

• Beiliang Du
  • $K_{1,pq}$-factorization of complete bipartite graphs, pp.85–92

  ---

• Mithilesh Kumar Singh, Kishore Sinha and Sanpei Kageyama
  • A construction of Hadamard matrices from BIBD $(2k^2-2k+1,k,1)$, pp.93–97

  ---

• A.D. Keedwell and V.A. Shcherbacov
  • On $m$-inverse loops and quasigroups with a long inverse cycle, pp.99–119

  ---

• Lutz Volkmann
  • Cycles through a given arc in certain almost regular multipartite tournaments, pp.121–133

  ---

• R.S. Rees
  • The spectrum of triangle-free regular graphs containing a cut vertex, pp.135–145

  ---

• K.L. McAvaney
  • Homogeneous cartesian products, pp.147–153

  ---

• Tomaž Pisanski and Thomas W. Tucker
  • Growth in products of graphs, pp.155–169

  ---

• Patricia McKenna, Margaret Morton and Jamie Sneddon
  • New domination conditions for tournaments, pp.171–182

  ---

• C. Delorme
  • Spectra and cuts, pp.183–191

  ---

• Tomislav Došlić
  • On lower bounds on the number of perfect matchings in $n$-extendable bricks, pp.193–198

  ---

• R.M. Figueroa-Centeno, R. Ichishima and F.A. Muntaner-Batle
  • Magical coronations of graphs, pp.199–208

  ---

• Gordon F. Royle
  • Regular vertex diameter critical graphs, pp.209–217

  ---

• Klaus Dohmen
  • Kernel operators and improved inclusion-exclusion bounds, pp.219–224

  ---

• P. Dukes
  • Orthogonal 3-GDDs with four groups, pp.225–232

  ---

• Wilfried Imrich and Peter F. Stadler
  • Minimum cycle bases of product graphs, pp.233–244

  ---

• Hailong Liu and Liang Sun
  • A note on signed and minus domination in graphs, pp.245–253

  ---

• Nicholas J. Cavenagh
  • A new bound on the size of the largest 2-critical set in a latin square, pp.255–263

  ---

• D. Rautenbach, I.E. Zverovich, and I.I. Zverovich
  • Extensions of $\alpha$-polynomial classes, pp.265–271

  ---

• Haruhide Matsuda
  • Degree conditions for the existence of $[k,k+1]$-factors containing a given Hamiltonian cycle, pp.273–281

  ---

• Yanxun Chang and Giovanni Lo Faro
  • Intersection numbers of Latin squares with their own orthogonal mates, pp.283–304

  ---

• Teresa W. Haynes and Michael A. Henning
  • Total domination good vertices in graphs, pp.305–315

  ---