


default search action
The Australasian Journal of Combinatorics, Volume 51
Volume 51, October 2011
- Le Anh Vinh:

A construction of 3-existentially closed graphs using quadrances. 3-6 - Nicolas Lichiardopol:

On a conjecture on total domination in claw-free cubic graphs: proof and new upper bound. 7-28 - Andreas Holtkamp, Lutz Volkmann:

On local connectivity of K2, p-free graphs. 29-40 - A. Nagarajan, R. Vasuki:

On the meanness of arbitrary path super subdivision of paths. 41-48 - Nader Jafari Rad:

Critical concept for 2-rainbow domination in graphs. 49-60 - Xiaoling Shen, Yaoping Hou:

The sandpile group of a bilateral regular tree. 61-76 - Lars-Daniel Öhman:

Latin squares with prescriptions and restrictions. 77-88 - Roland Lortz, Ingrid Mengersen:

Ramsey numbers for small graphs versus small disconnected graphs. 89-108 - Elizabeth J. Billington:

5-cycle decompositions from paired 3- and 4-cycle decompositions. 109-114 - Adriana Hansberg, Lutz Volkmann:

2-domination in bipartite graphs with odd independence number. 115-124 - P. Roushini Leely Pushpam, T. N. M. Malini Mai:

Weak edge Roman domination in graphs. 125-138 - John Lorch:

Orthogonal diagonal sudoku solutions: an approach via linearity. 139-146 - Ali Ahmad, K. M. Awan, Imran Javaid, Slamin:

Total vertex irregularity strength of wheel related graphs. 147-156 - John McCabe, Kathryn Weld:

On automorphisms of Cayley graphs, and irregular groups. 157-174 - Jason S. Kimberley, Jim A. MacDougall:

All regular graphs of small odd order are vertex-magic. 175-200 - Ali Ahmad, Muhammad Faisal Nadeem, Imran Javaid, Roslan Hasni:

On the super edge-magic deficiency of some families related to ladder graphs. 201-208 - Shasha Li, Xueliang Li, Yongtang Shi:

The minimal size of a graph with generalized connectivity κ3 = 2. 209-220 - Elizabeth J. Billington, Diane M. Donovan, James G. Lefevre, Thomas A. McCourt, Charles C. Lindner:

The triangle intersection problem for nested Steiner triple systems. 221-234 - Weixia Li, Hao Shen:

Simple 3-designs with block size d+1 from PSL(2, 2n) where d|(2n-1). 235-242 - M. A. Ollis, Devin Willmott:

On twizzler, zigzag and graceful terraces. 243-258 - Mike J. Grannell, Martin Knor:

Biembeddings of Latin squares obtained from a voltage construction. 259-270 - A. Donald Keedwell:

A short note regarding existence of complete sets of orthogonal diagonal Sudoku squares. 271-

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














