The Australasian Journal of Combinatorics

Volume 38 (2007)

• Martin Juvan, Jože Marinček, Bojan Mohar
  • Obstructions for simple embeddings, pp.3–25

  ---

• Zhi-Feng Zhu
  • The unimodality of independence polynomials of some graphs, pp.27–33

  ---

• Joanna Cyman
  • The outer-connected domination number of a graph, pp.35–46

  ---

• Damir Vukičević and Tomislav Došlić
  • Global forcing number of grid graphs, pp.47–62

  ---

• John P. McSorley, Alison Marr, Thomas D. Porter and W.D. Wallis
  • Closed-neighbourhood anti-Sperner graphs, pp.63–76

  ---

• Armen S. Asratian and Nikolay K. Khachatryan
  • On local nature of some classical theorems on Hamilton cycles, pp.77–86

  ---

• M.H. Albert, R.E.L. Aldred, M.D. Atkinson, H.P. van Ditmarsch, C.C. Handley, D.A. Holton, D.J. McCaughan and C.W. Monteith
  • Cyclically closed pattern classes of permutations, pp.87–100

  ---

• Alasdair Graham, David Pike and Nabil Shalaby
  • Skolem labelled trees and $P_s\Box P_t$ Cartesian products, pp.101–115

  ---

• Sizhong Zhou
  • Randomly $r$-orthogonal $(0,f)$-factorizations of $(0,mf-m+1)$-graphs, pp.117–126

  ---

• Jaroslav Ivančo and Andrea Semaničová
  • Some constructions of supermagic non-regular graphs, pp.127–139

  ---

• Olof Heden and Thomas Westerbäck
  • Non Phelps codes of length 15 and rank 14, pp.141–153

  ---

• J. Balogh, J. Lea nos, S. Pan, R.B. Richter and G. Salazar
  • The convex hull of every optimal pseudolinear drawing of $K_n$ is a triangle, pp.155–162

  ---

• M. Bača and M.Z. Youssef
  • Further results on antimagic graph labelings, pp.163–172

  ---

• Pak Tung Ho
  • On groupies in graphs, pp.173–177

  ---

• Maria Axenovich and Ryan Martin
  • On weighted Ramsey numbers, pp.179–194

  ---

• Taher Abualrub and Irfan Siap
  • Reversible cyclic codes over $Z_4$, pp.195–205

  ---

• Adrian Riskin
  • The circular $k$-partite crossing number of $K_{m,n}$, pp.207–210

  ---

• Wanpeng Lei and Jianzhong Wang
  • A sufficient condition for Hamilton cycles in bipartite tournaments, pp.211–220

  ---

• Gabriela Araujo, Diego González, Juan José Montellano-Ballesteros and Oriol Serra
  • On upper bounds and connectivity of cages, pp.221–228

  ---

• O. Favaron, H. Karami and S.M. Sheikholeslami
  • Total domination and total domination subdivision numbers, pp.229–235

  ---

• Pranay Chaudhuri and Hussein Thompson
  • A self-stabilizing distributed algorithm for edge-coloring general graphs, pp.237–247

  ---

• Zhu Xiaoying, Lianying Miao and Wang Cuiqi
  • On 3-choosability of plane graphs without 3-, 8- and 9-cycles, pp.249–254

  ---

• Richard M. Low and Larry Sue
  • Some new results on the integer-magic spectra of tessellation graphs, pp.255–266

  ---

• Sugata Gangopadhyay and Deepmala Sharma
  • On construction of non-normal Boolean functions, pp.267–272

  ---

• Petteri Kaski and Patric R.J. Östergård
  • There exists no symmetric configuration with 33 points and line size 6, pp.273–277

  ---

• Xuebin Zhang
  • Strong compatibly ordered OGDD of type $h^n$ for $n=6k+1$, pp.279–288

  ---

• Jocelyn Quaintance
  • Letter representations of $m\times n\times p$ proper arrays, pp.289–308

  ---

• Vladimir Samodivkin
  • Changing and unchanging acyclic domination: edge addition, pp.309–316

  ---