On the existence of (v,4,1)-PMD
Zhang, Xuebin
Ars Comb. 29, 3-12 (1990).
Modified group divisible designs
Assaf, Ahmed
Ars Comb. 29, 13-20 (1990).
On PBIBD constructions using t-designs
Sarvate, D. G.
Ars Comb. 29, 21-23 (1990).
On perfect binary arithmetic codes which can correct two errors or more
Lobstein, Antoine C.
Ars Comb. 29, 24-27 (1990).
Short proofs of some Fan-type results
Veldman, H. J.
Ars Comb. 29, 28-32 (1990).
Blocking sets in the large Mathieu designs. III: The case S(5,8,24)
Berardi, Luigia; Eugeni, Franco
Ars Comb. 29, 33-41 (1990).
Graphs with nonempty intersection of longest paths
Klavžar, S.; Petkovšek, M.
Ars Comb. 29, 43-52 (1990).
Near-factors of finite groups
de Cean, D.; Gregory, D. A.; Hughes, I. G.; Kreher, D. L.
Ars Comb. 29, 53-63 (1990).
Perfect Mendelsohn designs with block size four
Bennett, F. E.; Zhang, Xuebin; Zhu, L.
Ars Comb. 29, 65-72 (1990).
Existence of graphs with prescribed mean distance and local connectivity
Hao, Tianbao
Ars Comb. 29, 73-86 (1990).
An application of partitioned balanced tournament designs to the construction of semiframes with block size two
Rees, Rolf
Ars Comb. 29, 87-95 (1990).
Existence of nilpotent SQS-skeins of class n
Armanious, M. H.
Ars Comb. 29, 97-105 (1990).
Skew-symmetric matrices and the Pfaffian
Eğecioğlu, Ömer
Ars Comb. 29, 107-116 (1990).
Construction methods for adjusted orthogonal row-column designs
Eccleston, J. A.; Street, Deborah J.
Ars Comb. 29, 117-128 (1990).
(r,s)-domination in graphs and directed graphs
Mo, Zhuguo; Williams, Kenneth
Ars Comb. 29, 129-141 (1990).
Homogeneity conditions for finite partially ordered sets
Behrendt, Gerhard
Ars Comb. 29, 143-148 (1990).
The minimum size of critically m-neighbour-connected graphs
Wu, Shu-Shih Y.; Cozzens, Margaret B.
Ars Comb. 29, 149-160 (1990).
A note on indecomposable Kirkman squares
Lamken, E. R.
Ars Comb. 29, 161-167 (1990).
Cordial labellings of the Cartesian product and composition of graphs
Ho, Y. S.; Lee, S. M.; Shee, S. C.
Ars Comb. 29, 169-180 (1990).
Improved bounds for the union-closed sets conjecture
Sarvate, D. G.; Renaud, J.-C.
Ars Comb. 29, 181-185 (1990).
New classes of orthogonal designs
Kharaghani, H.
Ars Comb. 29, 187-192 (1990).
Simple t-designs with v≤30
Chee, Yeow Meng; Colbourn, Charles J.; Kreher, Donald L.
Ars Comb. 29, 193-258 (1990).
Mutually orthogonal frequency squares with non-constant frequency vectors
Laywine, Charles F.; Mullen, Gary L.
Ars Comb. 29, 259-264 (1990).
A new construction of k-Folkman graphs
Brown, Jason I.; Rödl, Vojtěch
Ars Comb. 29, 265-269 (1990).
A note on the characterizations of type-1 λ-designs in terms of rij
Hou, Xian Dong
Ars Comb. 29, 271-276 (1990).
Decidability of configuration theorems in projective planes and other incidence structures
Foldes, Stéphane
Ars Comb. 29, 277-281 (1990).
Bipartite analogues of split graphs and related topics
Frost, Howard B.; Jacobson, Michael S.; Kabell, Jerald A.; McMorris, F. R.
Ars Comb. 29, 283-288 (1990).
On the vulnerability of cycle permutation graphs
Piazza, B.; Ringeisen, R.; Stueckle, S.
Ars Comb. 29, 289-296 (1990).
No maximal partial spread of size 10 in PG(3,5)
Heden, Olof
Ars Comb. 29, 297-298 (1990).
Edge contractions in 3-connected graphs
McCuaig, William
Ars Comb. 29, 299-308 (1990).
On random walks in a plane
Csáki, E.; Mohanty, S. G.; Saran, Jagdish
Ars Comb. 29, 309-318 (1990).
