The Australasian Journal of Combinatorics

Volume 49 (2011)

• Nirmala Achuthan, N.R. Achuthan and M. Simanihuruk
  • The Nordhaus-Gaddum problem for the $k$-defective chromatic number of a $P_4$-free graph, pp.3–13

  ---

• R. Sampathkumar and M. Simaringa
  • Orthogonal double covers of complete bipartite graphs, pp.15–18

  ---

• Jonathan L. Gross
  • Genus distribution of graph amalgamations: self-pasting at root-vertices, pp.19–38

  ---

• Ralucca Gera and Pantelimon Stănică
  • The spectrum of generalized Petersen graphs, pp.39–45

  ---

• Anders Claesson, Mark Dukes and Sergey Kitaev
  • A direct encoding of Stoimenows matchings as ascent sequences, pp.47–59

  ---

• Saad El-Zanati, Kyle King and Jeff Mudrock
  • On the cyclic decomposition of circulant graphs into almost-bipartite graphs, pp.61–76

  ---

• D.A. Preece and E.R. Vaughan
  • Daisy chains with four generators, pp.77–93

  ---

• James East and Peter J. McNamara
  • On the work performed by a transformation semigroup, pp.95–109

  ---

• Christina Graves
  • Inflection points of coherent reliability polynomials, pp.111–126

  ---

• B.B. Bobga, J.L. Goldwasser, A.J.W. Hilton and P.D. Johnson Jr.
  • Completing partial latin squares: Cropper's question, pp.127–151

  ---

• Andreas Holtkamp
  • Maximal local edge-connectivity of diamond-free graphs, pp.153–158

  ---

• Stefano Innamorati
  • A characterization of the set of lines either external to or secant to an ovoid in PG$(3,q)$, pp.159–163

  ---

• J. Lauri, R. Mizzi and R. Scapellato
  • Two-fold automorphisms of graphs, pp.165–176

  ---

• Geoffrey Exoo, Ville Junnila and Tero Laihonen
  • Locating-dominating codes in cycles, pp.177–194

  ---

• L'udovít Niepel and Martin Knor
  • Efficient open domination in digraphs, pp.195–202

  ---

• S.R. Kingan
  • Stabilizers for GF$(5)$-representable matroids, pp.203–207

  ---

• Araya Chaemchan
  • Bounds on the arboricities of connected graphs, pp.209–215

  ---

• Xueliang Li and Yuefang Sun
  • On the rainbow $k$-connectivity of complete graphs, pp.217–226

  ---

• J. Richard Lundgren and Breeann Flesch
  • A characterization of $k$-trees that are interval $p$-graphs, pp.227–237

  ---

• László Major
  • On the distribution of coefficients of powers of positive polynomials, pp.239–243

  ---

• Steffen Grüter, Andreas Holtkamp and Michel Surmacs
  • On set colorings of complete bipartite graphs, pp.245–253

  ---

• Fi-yi Wei and Muhuo Liu
  • Ordering of the signless Laplacian spectral radii of unicyclic graphs, pp.255–264

  ---

• Szilárd András
  • A combinatorial generalization of Wilson's theorem, pp.265–272

  ---