The graphs determined by an adjacency property
Heinrich, Katherine
J. Comb. Math. Comb. Comput. 7, 3-9 (1990).
A Lanczos algorithm in a finite field and its application
Serra, M.; Slater, T.
J. Comb. Math. Comb. Comput. 7, 11-32 (1990).
Mixed telephone problems
Labahn, R.
J. Comb. Math. Comb. Comput. 7, 33-51 (1990).
Some new simple t-designs
Kreher, D. L.; Chee, Y. M.; de Cean, D.; Colbourn, C. J.; Kramer, E. S.
J. Comb. Math. Comb. Comput. 7, 53-90 (1990).
A new Bridge tournament schedule
Hwang, F. K.
J. Comb. Math. Comb. Comput. 7, 91-95 (1990).
On the products of Hadamard matrices, Williamson matrices and other orthogonal matrices using M-structures
Seberry, Jennifer; Yamada, Mieko
J. Comb. Math. Comb. Comput. 7, 97-137 (1990).
Integrity in graphs: Bounds and basics
Goddard, Wayne; Swart, Henda C.
J. Comb. Math. Comb. Comput. 7, 139-151 (1990).
Properties of 1-tough graphs
Dawes, Robin W.; Rodrigues, Marion G.
J. Comb. Math. Comb. Comput. 7, 153-159 (1990).
There are no circulant symmetric Williamson matrices of order 39
Koukouvinos, Christos; Kounias, Stratis
J. Comb. Math. Comb. Comput. 7, 161-169 (1990).
On the existence of whim domino squares
Fu, Hung-Lin; Shue, Chin-Lin
J. Comb. Math. Comb. Comput. 7, 171-175 (1990).
Parameter sets for a class of strongly regular graphs
Hartnell, Bert L.; Jeans, Neville; Kocay, William
J. Comb. Math. Comb. Comput. 7, 177-192 (1990).
The binding number of trees and K(1,3)-free graphs
Goddard, Wayne
J. Comb. Math. Comb. Comput. 7, 193-200 (1990).
Decompositions of hypergraphs into delta-systems and constellations
Lonc, Zbigniew
J. Comb. Math. Comb. Comput. 7, 201-217 (1990).
On the number of multiplicative partitions
Cao, Huizhong
J. Comb. Math. Comb. Comput. 7, 218-221 (1990).




