default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 33
Volume 33, October 2005
- Elias Dahlhaus, Paul D. Manuel, Mirka Miller:
Parallel algorithms for generalized clique transversal problems. 3-14 - Izak Broere, Elizabeth Jonck, Gayla S. Domke, Lisa R. Markus:
The induced path number of the complements of some graphs. 15-32 - Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley:
Safe communication for card players by combinatorial designs for two-step protocols. 33-46 - Junling Zhou, Yanxun Chang:
Product constructions for large sets of resolvable MTSs and DTSs. 47-56 - Ian T. Roberts, Leanne J. Rylands:
Minimal (n) and (n, h, k) Completely Separating Systems. 57-66 - J. Wang:
Existence of 2-perfect GD6CSs. 67-76 - Sarita Rudra, Shakti Banerjee, Sanpei Kageyama:
Constructions of 3-resolvable nested 3-designs and 3-wise balanced designs. 77-86 - Ian T. Roberts:
Completely separating systems of k-sets for 7 ≤ k ≤ 10. 87-98 - Christian Barrientos:
Graceful graphs with pendant edges. 99-108 - Rita SahaRay, Avishek Adhikari, Jennifer Seberry:
Critical sets in orthogonal arrays with 7 and 9 levels. 109-124 - Antonio Cossidente, Alessandro Siciliano:
On the largest minimal blocking set in PG(𝔽8). 125-128 - Jian Wang:
P7-factorization of complete bipartite graphs. 129-138 - Chengfu Qin, Xudong Yuan, Jianji Su:
Triangles in contraction critical 5-connected graphs. 139-146 - Yejing Wang, Jennifer Seberry, Beata J. Wysocki, Tadeusz A. Wysocki, Le Chung Tran, Ying Zhao, Tianbing Xia:
An exposure property of block designs. 147-156 - Yuejian Peng, Cheng Zhao:
On incomparable and uncomplemented families of sets. 157-168 - Dalibor Froncek, Petr Kovár, Tereza Kovárová:
Vertex magic total labeling of products of cycles. 169-182 - Antonio Pasini:
A tower of geometries related to the ternary Golay codes. 183-216 - Martin Hessler:
A computer study of some 1-error correcting perfect binary codes. 217-230 - Dimitri Leemans:
The residually weakly primitive geometries of HS. 231-236 - Donald A. Preece, Walter D. Wallis, Joseph L. Yucas:
Paley triple arrays. 237-246 - Lucia Gionfriddo, Charles C. Lindner:
Nesting kite and 4-cycle systems. 247-254 - Ju Zhou, Jinjiang Yuan:
Characterization of induced matching extendable graphs with 2n vertices and 3n-1 edges. 255-264 - Angelika Hellwig, Lutz Volkmann:
Neighborhood conditions for graphs and digraphs to be maximally edge-connected. 265-278 - William Duckworth:
Total domination of random regular graphs. 279-290 - Yousef Bani Hammad, Gary Carter, Ed Dawson, W. Müller, Yvonne Hitchcock:
RAK factoring algorithm. 291-306 - Michel Lavrauw, Maska Law:
BLT-sets admitting the symmetric group S4. 307-316 - Mostafa Blidia, Mustapha Chellali, Odile Favaron:
Independence and 2-domination in trees. 317-328 - Hong Wang:
On large cycles with lengths differing by one or two. 329-334 - Angelo Sonnino:
Transitive hyperovals in finite projective planes. 335-
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.
last updated on 2025-12-20 23:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
