On the existence of cols with equal-sized holes
Bennett, F. E.; Wu, Lisheng; Zhu, L.
Ars Comb. 26B, 5-36 (1988).
Maximal q-ary codes and Plotkin’s bound
Mackenzie, Conrad; Seberry, Jennifer
Ars Comb. 26B, 37-50 (1988).
Partitioning sets of triples into designs
Sharry, Martin J.; Street, Anne Penfold
Ars Comb. 26B, 51-66 (1988).
Perpendicular arrays and graph decompositions
Lindner, C. C.
Ars Comb. 26B, 67-92 (1988).
On extremal additive problems of Paul Erdős
Freiman, Gregory A.
Ars Comb. 26B, 93-114 (1988).
Redistribution of vertices for maximum edge count in K-edge-connected D- critical graphs
Caccetta, L.; Smyth, W. F.
Ars Comb. 26B, 115-132 (1988).
Further results on designs carried by a code
Gray, Ken
Ars Comb. 26B, 133-152 (1988).
New results on 3-chromatic prime distance graphs
Eggleton, Roger B.
Ars Comb. 26B, 153-180 (1988).
On the structure of graphs
Caccetta, L.; Vijayan, K.
Ars Comb. 26B, 181-190 (1988).
Freedom in matroids
Duke, Roger
Ars Comb. 26B, 191-216 (1988).
Methods for constructing balanced ternary designs
Donovan, Diane
Ars Comb. 26B, 217-226 (1988).
All possible representations of a class of C.H.Boolean functions and their minimizations from their corresponding graphs having n(>0) non-skew bridges
Basu, Manjusri
Ars Comb. 26B, 227-246 (1988).
Kk,k is (k−1,1)-critical for k-regular k-connected graphs
Aldred, R. E. L.; Jia, Rui-Zhong
4
Ars Comb. 26B, 247-248 (1988).
Graphs determined by their reliability polynomial
Chia, Gek-Ling; Colbourn, Charles J.; Myrvold, Wendy J.
Ars Comb. 26B, 249-251 (1988).
