The Australasian Journal of Combinatorics

Volume 47 (2010)

• Ryota Matsubara, Masao Tsugaki and Tomoki Yamashita
  • A neighborhood and degree condition for panconnectivity, pp.3–10

  ---

• Christos Koukouvinos and Dimitris E. Simos
  • New classes of orthogonal designs and weighing matrices derived from near normal sequences, pp.11–20

  ---

• Noureddine Ikhlef-Eschouf
  • Characterization of some $b$-chromatic edge critical graphs, pp.21–35

  ---

• Mauro Zannetti and Fulvio Zuanni
  • Note on three-character $(q+1)$-sets in PG$(3,q)$, pp.37–40

  ---

• Wai Chee Shiu, Wei Li and Wai Hong Chan
  • On the spectra of the fullerenes that contain a nontrivial cyclic-5-cutset, pp.41–51

  ---

• James Preen
  • Largest 6-regular toroidal graphs for a given diameter, pp.53–57

  ---

• John Asplund and Melissa S. Keranen
  • Proper edge coloring of BIBD$(v,4,\lambda)$s, pp.59–75

  ---

• Nader Jafari Rad
  • Characterization of total restrained domination edge critical unicyclic graphs, pp.77–82

  ---

• Lutz Volkmann
  • On almost 1-extendable graphs, pp.83–89

  ---

• Shuya Chiba, Ryota Matsubara and Masao Tsugaki
  • Relationships between the length of a longest path and the relative length, pp.91–107

  ---

• R. Julian R. Abel and Nigel H.N. Chan
  • Existence of doubly near resolvable $(v,4,3)$ BIBDs, pp.109–124

  ---

• Mustapha Chellali and Lutz Volkmann
  • Independence and global offensive alliance in graphs, pp.125–131

  ---

• Aleš Drápal, Carlo Hämäläinen and Dan Rosendorf
  • An enumeration of spherical latin bitrades, pp.133–143

  ---

• Benjamin R. Smith
  • Cycle decompositions of $\lambda$-fold complete equipartite graphs, pp.145–156

  ---

• Mustapha Chellali and Teresa W. Haynes
  • Double domination stable graphs upon edge removal, pp.157–164

  ---

• Patrick Bahls and Nathan Salazar
  • Symmetry and unimodality of independence polynomials of path-like graphs, pp.165–175

  ---

• Muhammad Nawaz, Muhammad Zafar-Yab and Munir Akhtar
  • Construction of variety competition cyclic balanced designs on square lattice, pp.177–187

  ---

• Weihua Yang and Jixiang Meng
  • Extraconnectivity of hypercubes (II), pp.189–195

  ---

• Jun Shen
  • Splitting group divisible designs with block size $2\times 4$, pp.197–204

  ---

• Hui-Wen Cheng
  • Note on cubic symmetric graphs of order $2p^n$, pp.205–210

  ---

• Mária Ždímalová and Marián Olejár
  • Large Cayley digraphs of given degree and diameter from sharply $t$-transitive groups, pp.211–216

  ---

• Nader Jafari Rad
  • Bicritical total domination, pp.217–226

  ---

• A.D. Keedwell
  • Constructions of complete sets of orthogonal diagonal Sudoku squares, pp.227–238

  ---

• Mahdad Khatirinejad and Patric R.J. Östergård
  • A census of one-factorizations of the complete 3-uniform hypergraph of order 9, pp.239–245

  ---

• John Lorch
  • Orthogonal combings of linear sudoku solutions, pp.247–264

  ---

• Ian Roberts and Jamie Simpson
  • A note on the union-closed sets conjecture, pp.265–267

  ---

• Magda Dettlaff and Magdalena Lemańska
  • Strong weakly connected domination subdivisible graphs, pp.269–277

  ---

• A. Aguglia and V. Giordano
  • A generalization of a result of Segre on permutable polarities, pp.279–283

  ---

• Muhuo Liu and Bolian Liu
  • Some properties of the first general Zagreb index, pp.285–294

  ---