No CrossRef data available.
Article contents
Sugar beet, guinea pigs and graph theory
Published online by Cambridge University Press: 01 August 2016
Extract
I. Scientific background
Here are two problems in applied combinatorics.
Problem I
A plant breeder wants to assess the yields of several varieties of sugar beet. The plots of land on which the experiment is to be grown are arranged in a row: each plot is to be planted with seed of a single variety. There is enough seed for more than one appearance of each variety.
- Type
- Research Article
- Information
- Copyright
- Copyright © The Mathematical Association 1986
References
1.
Denes, J. and Keedwell, A.D., Latin squares and their applications. English Universities Press, London (1974).Google Scholar
2.
Deo, N., Graph theory with applications to engineering and computer science. Prentice-Hall, New Jersey (1974).Google Scholar
3.
Finney, D.J. and Outhwaite, A.D., Serially balanced sequences in bioassay, Proc. R. Soc., B, 41, 493–507 (1956).Google Scholar
5.
Keedwell, A.D., Some problems concerning complete Latin squares. In Combinatorics, London Mathematical Society Lecture Note Series No. 13, Cambridge University Press (1981).Google Scholar
6.
Williams, R.M., Experimental designs for serially correlated observations, Biometrika, 39, 151–167 (1952).Google Scholar