Volume 406 of the series Lecture Notes in Mathematics pp 339349
The charm bracelet problem and its applications
 Paul K. StockmeyerAffiliated withCollege of William and Mary
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.
 Title
 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
 Pages
 pp 339349
 Copyright
 1974
 DOI
 10.1007/BFb0066456
 Print ISBN
 9783540068549
 Online ISBN
 9783540378099
 Series Title
 Lecture Notes in Mathematics
 Series Volume
 406
 Series ISSN
 00758434
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag Berlin
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors
 Authors

 Paul K. Stockmeyer ^{(1)}
 Author Affiliations

 1. College of William and Mary, USA
Continue reading...
To view the rest of this content please follow the download PDF link above.