Construction of some classes of self-converse duality-graphs
Grieco, M.; Zucchetti, B.
Ars Comb. 24A, 9-19 (1987).
Computer aided search for all graphs such that both graph and its complement have its spectrum rounded from below by -2
Radosavljević, Z.; Simić, S.
Ars Comb. 24A, 21-27 (1987).
Arcs and blocking sets in symmetric designs
Eugeni, Franco; Innamorati, Stefano
Ars Comb. 24A, 29-45 (1987).
On graphs with prescribed spanning subgraphs
Vestergaard, Preben Dahl
Ars Comb. 24A, 47-58 (1987).
On the order of vertex sets meeting all edges of a 3-partite hypergraph
Tuza, Zsolt
Ars Comb. 24A, 59-63 (1987).
On semiovals in projective planes
de Finis, Massimo
Ars Comb. 24A, 65-70 (1987).
On solving computationally difficult set covering problems
Peter-Orth, Christoph
Ars Comb. 24A, 71-96 (1987).
Fully-colored Hamiltonian cycles in edge-colourings of Kn (n odd) when there are no fully-coloured C′4s
Walker, K.
Ars Comb. 24A, 97-105 (1987).
Some Steiner quadruple systems S(3,4,16) such that all 16 derived triple systems S(2,3,15) are isomorphic
de Vries, Hans Ludwig
Ars Comb. 24A, 107-129 (1987).
Some combinatorial properties of the dual Lorimer plane
de Resmini, Marialuisa J.; Puccio, Luigia
Ars Comb. 24A, 131-148 (1987).
On simply disconnected tournaments
Burzio, Marco; Demaria, Davide Carlo
Ars Comb. 24A, 149-161 (1987).
Existence and extension of sharply k-transitive permutation sets: A survey and some new results
Bonisoli, Arrigo; Quattrocchi, Pasquale
Ars Comb. 24A, 163-173 (1987).
On the intersection problem for three Steiner triple systems
Milici, Salvatore; Quattrocchi, Gaetano
Ars Comb. 24A, 175-194 (1987).
Isomorphism of circulant combinatorial structures
Phelps, K. T.
Ars Comb. 24A, 195-210 (1987).
Some results on the largest eigenvalue of a graph
Simić, Slobodan K.
Ars Comb. 24A, 211-219 (1987).
