We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)
References
1
1.Langford, C. D., Problem, Mathl Gaz.42, 228 (No. 341, October 1958).Google Scholar
2
2.Priday, C. J., On Langford’s problem (I), Mathl Gaz.43, 250 (No. 346, December 1959).Google Scholar
3
3.Davies, R. O., On Langford’s problem (II), Mathl Gaz.43, 253 (No. 346, December 1959).Google Scholar
4
4.Baron, G., Über Verallgemeinerungen des Langford’schen Problems; in Erdös, P., Rényi, A. and Sós, V. T. (ed.), Combinatorial theory and its applicationsI, p. 81. North-Holland (1970).Google Scholar
5
5.Roselle, D. P. and Thomasson, T. C.Jr, On generalized Langford sequences, J. Combinatorial Theory11, 196 (1971).Google Scholar
6
6.Dillon, J. F., The generalized Langford-Skolem problem, Proceedings of the Fourth Southeastern Conference on Combinatorics, Graph Theory and Computing, 237 (1973).Google Scholar
7
7.Saito, S. and Hayasaka, T., The generalized Langford sequence, Research Reports Miyagi Technical College12, 93 (1975). (Reviewed in Mathematical Reviews 54, #105 (No. 1, 1977).)Google Scholar
8
8.Saito, S. and Hayasaka, T., The Langford (4,n)-sequence: a trigonometric approach, Discrete Mathematics28 (1979), to appear.Google Scholar