The Australasian Journal of Combinatorics

Volume 53 (2012)

• Patrick Bahls
  • On the independence polynomials of path-like graphs, pp.3–18

  ---

• Magda Dettlaff and Magdalena Lemańska
  • Influence of edge subdivision on the convex domination number, pp.19–30

  ---

• Toufik Mansour and Mark Shattuck
  • Set partitions as geometric words, pp.31–39

  ---

• Matthias Böhm
  • $k$-regular antichains on $[m]$ with $k\leq m-2$, pp.41–52

  ---

• Michitaka Furuya
  • Construction of $(\gamma,k)$-critical graphs, pp.53–65

  ---

• Mostafa Blidia, Noureddine Ikhlef Eschouf and Frédéric Maffray
  • $b$-coloring of some bipartite graphs, pp.67–76

  ---

• Eugen Mandrescu
  • Unimodality of some independence polynomials via their palindromicity, pp.77–82

  ---

• Harris Kwong, Sin-Min Lee, Sheng-Ping Bill Lo, Hsin-Hao Su and Yung-Chin Wang
  • On uniformly balanced graphs, pp.83–95

  ---

• Danny Dyer and Rebecca Milley
  • A time-constrained variation of the Watchman's Walk problem, pp.97–108

  ---

• Catarina P. Avelino and Altino F. Santos
  • Spherical and planar folding tessellations by kites and equilateral triangles, pp.109–125

  ---

• Robert A. Beeler and D. Paul Hoilman
  • Peg solitaire on the windmill and the double star graphs, pp.127–134

  ---

• G.R. Vijayakumar
  • Some results on near factorizations of boolean groups, pp.135–139

  ---

• S. Monikandan and J. Balakumar
  • Reconstruction of bipartite graphs and triangle-free graphs with connectivity two, pp.141–150

  ---

• Danny Dyer, Ian Payne, Nabil Shalaby and Brenda Wicks
  • On the graceful conjecture for triangular cacti, pp.151–170

  ---

• Jana Šiagiová and Jozef Širáň
  • Covalence sequences of transitive plane tessellations and transitive maps on surfaces, pp.171–178

  ---

• Mirka Miller, Oudone Phanalasy, Joe Ryan and Leanne Rylands
  • Antimagicness of some families of generalized graphs, pp.179–190

  ---

• Hongyu Liang
  • Computational complexity of the negative decision number of graphs, pp.191–205

  ---

• D.I. Gannon and S.I. El-Zanati
  • All 2-regular graphs with uniform odd components admit $\rho$-labellings, pp.207–219

  ---

• Tina Helms, Heather Jordon, Maggie Murray and Stephanie Zeppetello
  • Extended Skolem type difference sets, pp.221–235

  ---

• S. Arumugam and M. Nalliah
  • Super $(a,d)$-edge antimagic total labelings of friendship graphs, pp.237–243

  ---

• Richard A. Brualdi, Kathleen P. Kiernan, Seth A. Meyer and Michael W. Schroeder
  • Cyclic matching sequencibility of graphs, pp.245–256

  ---

• Quan-Hui Yang and Feng-Juan Chen
  • Partitions of ${\mathbb Z}_m$ with the same representation functions, pp.257–262

  ---

• O. Al-Mushayt, Ali Ahmad and M.K. Siddiqui
  • On the total edge irregularity strength of hexagonal grid graphs, pp.263–271

  ---

• Andrzej Włoch
  • On 2-dominating kernels in graphs, pp.273–284

  ---

• Hamid-Reza Fanaï
  • Permanent rank and transversals, pp.285–288

  ---

• Mustapha Chellali and Nader Jafari Rad
  • $k$-independence critical graphs, pp.289–298

  ---

• Brendon Stanton
  • Vertex identifying codes for the $n$-dimensional lattice, pp.299–307

  ---