Graphs and Combinatorics pp 339-349
The charm bracelet problem and its applications
- First Online:
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 . For further background and broader treatment of topics of an enumerative nature,  should be consulted.
Unable to display preview. Download preview PDF.
- 1.Burnside, W., Theory of Groups of Finite Order. Second Edition, Cambridge University Press, 1911. Reprinted Dover, 1955, New York.Google Scholar
- 2.Guy, R. K., "Dissecting a Polygon into Triangles", Research Report, University of Calgary, 1960.Google Scholar
- 3.Harary, F., Graph Theory. Addison-Wesley, 1969, Reading.Google Scholar
- 8.Harary, F., and Robinson, R. W., "The Number of Achiral Trees", J. Reine Angew. Math., to appear.Google Scholar