Keywords
- Automorphism Group
- Common Edge
- Neighboring Vertex
- Root Edge
- Identity Reflection
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
L. W. Beineke and R. E. Pippert, The number of labeled dissections of a k-ball, Math. Ann. 191 (1971), 87–98.
__________, Enumerating dissectible polyhedra, submitted for publication.
W. G. Brown, Historical note on a recurrent combinatorial problem, Amer. Math. Monthly 72 (1965), 973–977.
R. K. Guy, Dissecting a polygon into triangles, Bull. Malayan Math. Soc. 5 (1958), 57–60; Same title, Research Paper No. 9, The University of Calgary, 1967.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1972 Springer-Verlag
About this paper
Cite this paper
Beineke, L.W., Pippert, R.E. (1972). A census of ball and disk dissections. In: Alavi, Y., Lick, D.R., White, A.T. (eds) Graph Theory and Applications. Lecture Notes in Mathematics, vol 303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0067354
Download citation
DOI: https://doi.org/10.1007/BFb0067354
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06096-3
Online ISBN: 978-3-540-38114-3
eBook Packages: Springer Book Archive
