The Australasian Journal of Combinatorics

Volume 46 (2010)

• Dorota Kuziak
  • Interpolation properties of domination parameters of a graph, pp.3–12

  ---

• Pak Tung Ho
  • On Ramsey unsaturated and saturated graphs, pp.13–18

  ---

• Moharram N. Iradmusa
  • A note on partial list coloring, pp.19–24

  ---

• D.A. Mojdeh, P. Firoozi and R. Hasni
  • On connected $(\gamma,k)$-critical graphs, pp.25–35

  ---

• S. Arumugam, Odile Favaron and S. Sudha
  • Irredundance saturation number of a graph, pp.37–49

  ---

• J. Wang and L. Yin
  • A class of group divisible designs with block size three and index $\lambda$, pp.51–66

  ---

• I.S. Kotsireas, C. Koukouvinos, J. Seberry and D.E. Simos
  • New classes of orthogonal designs constructed from complementary sequences with given spread, pp.67–78

  ---

• Ryan Bauer and Hong Wang
  • Disjoint triangles and pentagons in a graph, pp.79–89

  ---

• Michael Fraboni and Nathan Shank
  • Maximum graphs with unique minimum dominating set of size two, pp.91–99

  ---

• Tiziana Masini
  • A combinatorial characterization of the Hermitian surface, pp.101–107

  ---

• Suk J. Seo and Peter J. Slater
  • Open neighborhood locating dominating sets, pp.109–120

  ---

• Salvatore Milici and Giorgio Ragusa
  • Maximum embedding of an $H(v-w,3,1)$ into a TS$(v,\lambda)$, pp.121–127

  ---

• Jamie Simpson
  • Modified Padovan words and the maximum number of runs in a word, pp.129–145

  ---

• Hong-Yong Fu and Dezheng Xie
  • Equitable $L(2,1)$-labelings of Sierpi\'nski graphs, pp.147–156

  ---

• K.M. Koh, T.S. Ting, Z.L. Xu and F.M. Dong
  • Lower bound on the weakly connected domination number of a cycle-disjoint graph, pp.157–166

  ---

• Renwang Su
  • Existence of $(K_4-e)$-GDDs of type $2^n$, pp.167–172

  ---

• I.D. Gray and J.A. MacDougall
  • Vertex-magic labeling of non-regular graphs, pp.173–183

  ---

• Allan Frendrup, Bert Hartnell and Preben Dahl Vestergaard
  • A note on equimatchable graphs, pp.185–190

  ---

• Kannan Balakrishnan, Manoj Changat and Henry Martyn Mulder
  • The plurality strategy on graphs, pp.191–202

  ---

• Shuya Chiba, Yoshimi Egawa and Kiyoshi Yoshimoto
  • A 2-factor in which each cycle contains a vertex in a specified stable set, pp.203–210

  ---

• Andrzej Włoch and Iwona Włoch
  • Generalized Pell numbers, graph representations and independent sets, pp.211–215

  ---

• A. Gupta, G. Gutin, M. Karimi, E.J. Kim and A. Rafiey
  • Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs, pp.217–232

  ---

• B. Sharada and Nandappa D. Soner
  • On the domination subdivision numbers of trees, pp.233–239

  ---

• Abdollah Khodkar, Sam Nolen and James T. Perconti
  • Super edge-graceful labelings of complete bipartite graphs, pp.241–261

  ---

• Xiuwen Ma and Zihong Tian
  • On $\alpha$-resolvable directed cycle systems for cycle length 4, pp.263–268

  ---

• Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson and Colton Magnant
  • Ramsey numbers in rainbow triangle free colorings, pp.269–284

  ---

• Paweł Prałat
  • When does a random graph have constant cop number?, pp.285–296

  ---

• You Lu and Jun-Ming Xu
  • Bipanconnectivity of Cartesian product networks, pp.297–306

  ---

• Y.M. Borse
  • Forbidden-minors for splitting binary gammoids, pp.307–314

  ---

• Italo J. Dejter
  • Corrigendum to: On a $\{K_4,K_{2,2,2}\}$-ultrahomogeneous graph, p.315

  ---