The charm bracelet problem and its applications
- Paul K. StockmeyerAffiliated withCollege of William and Mary
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.
- The charm bracelet problem and its applications
- Book Title
- Graphs and Combinatorics
- Book Subtitle
- Proceedings of the Capital Conference on Graph Theory and Combinatorics at the George Washington University June 18–22, 1973
- pp 339-349
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Mathematics
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.