On self orthogonal diagonal Latin squares
Danhof, K. J.; Phillips, N. C. K.; Wallis, W. D.
J. Comb. Math. Comb. Comput. 8, 3-8 (1990).
Some combinatorial inequalities on the existence of balanced arrays
Chopra, D. V.
J. Comb. Math. Comb. Comput. 8, 9-12 (1990).
On symmetric designs whose incidence matrices satisfy a certain condition
Pott, Alexander
J. Comb. Math. Comb. Comput. 8, 13-16 (1990).
A Turán problem for Cartesian products of hypergraphs
de Cean, D.; Kreher, D. L.; Wiseman, J. A.
J. Comb. Math. Comb. Comput. 8, 17-25 (1990).
Constructing BIBDs by an expert system
Rasch, Dieter
J. Comb. Math. Comb. Comput. 8, 27-29 (1990).
On the existence of simple and indecomposable block designs with block size 4
Shen, Hao
J. Comb. Math. Comb. Comput. 8, 31-38 (1990).
Concavity properties of numbers of solutions of diophantine equations
Landman, Bruce; Portier, Frederick; Vaughan, Theresa
J. Comb. Math. Comb. Comput. 8, 39-49 (1990).
Maximal configurations of stars
Fu, Hung-Lin; Huang, Kuo-Ching; Shue, Chin-Lin
J. Comb. Math. Comb. Comput. 8, 51-59 (1990).
An alternative proof of Hadamard’s determinant theorem
Lin, Cantian
J. Comb. Math. Comb. Comput. 8, 61-63 (1990).
Similar graphs: Characterization and subclasses
Ali, Hesham H.; Sherwani, Naveed A.; Boals, Alfred
J. Comb. Math. Comb. Comput. 8, 65-78 (1990).
On matching and chromatic properties of circulants
Farrell, E. J.; Whitehead, Earl Glen jun.
J. Comb. Math. Comb. Comput. 8, 79-88 (1990).
A census of dicyclic (v,4,2)-designs for v≤22
Franek, F.; Mathon, R.; Mullin, R. C.; Rosa, A.
J. Comb. Math. Comb. Comput. 8, 89-96 (1990).
A note on the characterization of thistles by their matching polynomials
Farrell, E. J.; Wahid, S. A.
J. Comb. Math. Comb. Comput. 8, 97-101 (1990).
Accurate bounds for new van der Waerden type numbers
Landman, Bruce M.; Greenwell, Raymond N.
J. Comb. Math. Comb. Comput. 8, 103-106 (1990).
On the set J0(ν) for Steiner quadruple systems
Quattrocchi, Gaetano
J. Comb. Math. Comb. Comput. 8, 107-109 (1990).
Indecomposable simple 2-(v,k,λ) designs of small orders
Shen, Hao
J. Comb. Math. Comb. Comput. 8, 111-117 (1990).
On the product of k-minimal domination numbers of a graph and its complement
Cockayne, E. J.; Mynhardt, C. M.
J. Comb. Math. Comb. Comput. 8, 118-122 (1990).
A note on packing complete graphs with trees
Guichard, David R.; Massman, John D.
J. Comb. Math. Comb. Comput. 8, 123-126 (1990).
Dominance method for plane partitions. V: Enumeration of ladder tableaux
Chu, W. C.
J. Comb. Math. Comb. Comput. 8, 127-136 (1990).
The Ramsey numbers R(K3,K6−e) and R(K3,K9−e)
Radziszowski, Stanisław
J. Comb. Math. Comb. Comput. 8, 137-145 (1990).
Nesting of cycle systems of even length
Lindner, C. C.; Stinson, D. R.
J. Comb. Math. Comb. Comput. 8, 147-157 (1990).
Slightly improved upper bounds for equidistant permutation arrays of index one
van Rees, G. H. J.
J. Comb. Math. Comb. Comput. 8, 159-160 (1990).
The range of the determinant function on the set of n×n (0,1)- matrices
Craigen, R.
J. Comb. Math. Comb. Comput. 8, 161-171 (1990).
Neighborhood and self-dual (multi)graphs
McKee, Terry A.
J. Comb. Math. Comb. Comput. 8, 173-180 (1990).
Perfect Mendelsohn designs with equal-sized holes
Bennett, F. E.; Zhu, L.
J. Comb. Math. Comb. Comput. 8, 181-186 (1990).
On maximal clique irreducible graphs
Wallis, W. D.; Zhang, Guo-Hui
J. Comb. Math. Comb. Comput. 8, 187-193 (1990).
Heuristic algorithms for finding irregularity strengths of graphs
Garnick, David K.; Dinitz, Jeffrey H.
J. Comb. Math. Comb. Comput. 8, 195-208 (1990).
A new approach to distance stable graphs
Goddard, Wayne; Oellermann, Ortrud R.; Swart, Henda C.
J. Comb. Math. Comb. Comput. 8, 209-220 (1990).
