Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N.G. de Bruijn and T. van Aardenne-Ehrenfest, Circuits and Trees in Oriented Linear Graphs, Simon Stevin 28 (1951), 203–217.
W.T. Tutte, The Dissection of Equilateral Triangles into Equilateral Triangles, Proc. Cambr. Phil. Soc. 44 (1948), 463–482.
R. Dawson and I.J. Good, Exact Markov Probabilities from Oriented Linear Graphs, Ann. Math. Stat. 28 (1957), 946–956.
D.E. Knuth, Oriented Subtrees of an Arc Digraph, J. Comb. Yheory 3 (1967), 309–314.
L.R. Ford, Jr., A Cyclic Arrangement of M-tuples, Report P-1071, Rand Corporation, Santa Monica, Cal. (1957).
H. Fredricksen, The Lexicographically Least De Bruijn Cycle, J. Comb. Theory 9 (1970), 1–5.
E. Roth, Permutations Arranged around a Circle, Amer. Math. Monthly (1971), 990–992.
A. Lempel, m-ary Closed Sequences, J. Comb. Theory 10 (1971), 253–258.
S.W. Golomb, Shift Register Sequences, Holden-Day, Inc., San Francisco (1967).
Rights and permissions
Copyright information
© 1974 Springer-Verlag
About this paper
Cite this paper
van Lint, J.H. (1974). IX. De bruign sequences. In: Combinatorial Theory Seminar Eindhoven University of Technology. Lecture Notes in Mathematics, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057328
Download citation
DOI: https://doi.org/10.1007/BFb0057328
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06735-1
Online ISBN: 978-3-540-38316-1
eBook Packages: Springer Book Archive