Abstract
The necklace problem has proved to be both a sound pedagogical device in teaching enumeration theory and a valuable counting tool with several graphical applications. In this paper we solve the more general charm bracelet problem and provide two applications for which the necklace problem in not sufficient.
We set the stage in Section 1 by providing a brief review of the necklace problem. This serves as a basis for comparison in Section 2, where we discuss the charm bracelet problem and derive its solution. Sections 3 and 4 contain nontrivial graphical applications of the results of Section 2.
Definitions for all graphical terms and concepts can be found in [3]. For further background and broader treatment of topics of an enumerative nature, [5] should be consulted.
This research was supported by the Office of Naval Research under contract N00014-73-A-0374-0001, NR044-459. Reproduction in whole or in part is permitted for any purpose of the United States Government.
This is a preview of subscription content, log in via an institution to check access.
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
Burnside, W., Theory of Groups of Finite Order. Second Edition, Cambridge University Press, 1911. Reprinted Dover, 1955, New York.
Guy, R. K., "Dissecting a Polygon into Triangles", Research Report, University of Calgary, 1960.
Harary, F., Graph Theory. Addison-Wesley, 1969, Reading.
Harary, F., "Enumeration Under Group Action: Unsolved Graphical Enumeration Problems, IV." J. Comb. Theory, 8 (1970) 1–11.
Harary, F., and Palmer, E. M., Graphical Enumeration, Academic Press, 1973, New York.
Harary, F., and Prins, G., "The Number of Homomorphically Irreducible Trees and Other Species", Acta Math. 101 (1959) 141–162.
Harary, F., Prins, G., Tutte, W. t., "The Number of Plane Trees", Indag. Math 26 (1964) 319–329.
Harary, F., and Robinson, R. W., "The Number of Achiral Trees", J. Reine Angew. Math., to appear.
Moon, J. W., and Moser, L., "Triangular Dissections of n-gons" Canad. Math. Bull. 6 (1963) 175–177.
Otter, R., "The Number of Trees", Ann. of Math. 49 (1948) 583–599.
Pólya, G., "Kombinatorische Anzehlbestimmungen für Gruppen, Graphen und chemische Verbindungen", Acta Math. 68 (1937) 145–254.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin
About this paper
Cite this paper
Stockmeyer, P.K. (1974). The charm bracelet problem and its applications. In: Bari, R.A., Harary, F. (eds) Graphs and Combinatorics. Lecture Notes in Mathematics, vol 406. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066456
Download citation
DOI: https://doi.org/10.1007/BFb0066456
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06854-9
Online ISBN: 978-3-540-37809-9
eBook Packages: Springer Book Archive