The charm bracelet problem and its applications

  • Paul K. Stockmeyer
Part III: Contributed Papers New Results On Graphs And Combinatorics

DOI: 10.1007/BFb0066456

Part of the Lecture Notes in Mathematics book series (LNM, volume 406)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin 1974

Authors and Affiliations

  • Paul K. Stockmeyer
    • 1
  1. 1.College of William and MaryUSA

Personalised recommendations