On construction hypergraphs without property B
Exoo, Geoffrey
Ars Comb. 30, 3-12 (1990).
On the support size of 3-designs with repeated blocks
Mahmoodian, Ebadollah S.
Ars Comb. 30, 13-22 (1990).
A family of D-optimal designs
Whiteman, Albert L.
Ars Comb. 30, 23-26 (1990).
A note on distar-factorizations
Caetano, Paul Vieira; Heinrich, Katharine
Ars Comb. 30, 27-32 (1990).
Finding nice crystallizations for handle free n-manifolds
Cavicchioli, Alberto
Ars Comb. 30, 33-49 (1990).
Rotation numbers for generalised stars
Cockayne, E. J.; Lorimer, P. J.; Mynhardt, C. M.
Ars Comb. 30, 50-64 (1990).
Tables of parameters of BIBDs with r≤41 including existence, enumeration and resolvability results: An update
Mathon, Rudolf; Rosa, Alexander
Ars Comb. 30, 65-96 (1990).
Polygonal path constructions for Tuscan-k squares
Golomb, Solomon W.; Etzion, Tuvi; Taylor, Herbert
Ars Comb. 30, 97-140 (1990).
Perfect colourings
Brown, Jason I.; Corneil, Derek G.
Ars Comb. 30, 141-159 (1990).
The transitive graphs with at most 26 vertices
McKay, Brendam D.; Royle, Gordon F.
Ars Comb. 30, 161-176 (1990).
Eulerian subgraphs in graphs with short cycles
Catlin, Paul A.; Lai, Hong-Jian
Ars Comb. 30, 177-191 (1990).
On near-ovals and near-systems in SQS
Neidhardt, W.
Ars Comb. 30, 193-202 (1990).
Upper and lower bounds for the number of monotone crossing free Hamiltonian cycles from a set of points
Meijer, Henk; Rappaport, David
Ars Comb. 30, 203-208 (1990).
Decomposing the complement of 3-nets (Latin squares) into triples. (A natural generalization of GDD’s)
Mendelsohn, E.; Shalaby, N.
Ars Comb. 30, 209-224 (1990).
The flower intersection problem for Steiner systems S(3,4,v), v=4⋅2n, 5⋅2n
Milici, Salvatore; Quattrochi, Gaetano
Ars Comb. 30, 225-240 (1990).
Further results on base sequences, disjoint complementary sequences, OD(4t;t,t,t,t) and the excess of Hadamard matrices
Koukouvinos, Christos; Kounias, Stratis
Ars Comb. 30, 241-256 (1990).
Concerning 3-factorizations of 3Kn,n
Colbourn, Charles J.
Ars Comb. 30, 257-274 (1990).
Semibandwidth of bipartite graphs and matrices
Brualdi, Richard A.; McDougal, Kevin F.
Ars Comb. 30, 275-287 (1990).
Most graphs are edge-cordial
Collins, Karen L.; Hovey, Mark
Ars Comb. 30, 289-295 (1990).
More on decomposable 3-(12,6,4) designs
Breach, D. R.; Thompson, A. R.
Ars Comb. 30, 297-303 (1990).
Inclusion of trees in their iterated line graphs
Chawathe, P. D.; Joshi, N. A.
Ars Comb. 30, 305-307 (1990).
Divisibility properties of some number arrays
Razpet, Marko
Ars Comb. 30, 308-318 (1990).
