But where are designs used
Street, Deborah J.; Street, Anne Penfold
Ars Comb. 53, 3-26 (1999).
The edge covering number of ordered sets
Lee, Jeh Gwon
Ars Comb. 53, 27-32 (1999).
Embedding partial extended triple systems when \(λ≥2\)
Raines, M. E.; Rodger, C. A.
Ars Comb. 53, 33-72 (1999).
The size of the smallest strong critical set in a Latin square
Bate, J. A.; van Rees, G. H. J.
Ars Comb. 53, 73-83 (1999).
Bounds on the size of critical edge-chromatic graphs
Haile, Dawit
Ars Comb. 53, 85-96 (1999).
The existence of self-conjugate self-orthogonal idempotent diagonal Latin squares
Du, Beiliang; Wallis, W. D.
Ars Comb. 53, 97-109 (1999).
Compositions with \(m\) distinct parts
Knopfmacher, Arnold; Mays, M. E.
Ars Comb. 53, 111-128 (1999).
On Steiner triple systems and perfect codes
Näslund, Mats
Ars Comb. 53, 129-132 (1999).
Generalized Steiner systems with block size three and group size four
Phelps, Kevin; Yin, Carol
Ars Comb. 53, 133-146 (1999).
On the existence of \((v,n,4,λ)\)-IPMD for even \(λ\)
Kong, Gaohua; Zhang, Xuebin
Ars Comb. 53, 147-159 (1999).
On Skolem labelling of windmills
Mendelsohn, E.; Shalaby, N.
Ars Comb. 53, 161-172 (1999).
Codes of \(C(n,n,1)\) designs
Salwach, J. Chester
Ars Comb. 53, 173-179 (1999).
Minimal partitions of a graph
Porter, Thomas Dale
Ars Comb. 53, 181-186 (1999).
Self-complementary circulant graphs
Alspach, Brian; Morris, Joy; Vilfred, V.
Ars Comb. 53, 187-191 (1999).
The application of determining sets to projective configurations
Kocay, William; Szypowski, Ryan
Ars Comb. 53, 193-207 (1999).
Card sorting by dispersions and fractal sequences
Kimberling, Clark; Shultz, Harris S.
Ars Comb. 53, 209-218 (1999).
A note on orders with level diagrams
Roddy, Michael S.
Ars Comb. 53, 219-224 (1999).
An application of covering designs: determining the maximum consistent set of shares in a threshold scheme
Rees, R. S.; Stinson, D. R.; Wei, Ruizhong; van Rees, G. H. J.
Ars Comb. 53, 225-237 (1999).
On the number of dependent sets in a connected graph
Horrocks, David G. C.
Ars Comb. 53, 239-247 (1999).
Isomorphic star decompositions of multicrowns and the power of cycles
Lin, Chiang; Lin, Jenq-Jong; Shyu, Tay-Woei
Ars Comb. 53, 249-256 (1999).
Gracefulness of replicated paths and cycles
Ramírez-Alfonsín, J. L.
Ars Comb. 53, 257-269 (1999).
Isomorphic factorization of complete bipartite graph into forest
Araki, Toru; Shibata, Yukio
Ars Comb. 53, 271-281 (1999).
A family of 4-designs on 38 points
Acketa, Dragan M.; Mudrinski, Vojislav
Ars Comb. 53, 283-290 (1999).
Infinite designs with more point orbits than block orbits
Webb, Bridget S.
Ars Comb. 53, 291-308 (1999).
Block graphs of \(Z\)-transformation graphs of perfect matchings of plane elementary bipartite graphs
Zhang, Heping; Zhang, Fuji
Ars Comb. 53, 309-314 (1999).
Almost resolvable directed \(m\)-cycle systems: \(m≡3(mod 6)\)
Fu, H. L.; Rodger, C. A.
Ars Comb. 53, 315-318 (1999).
