Abstract
Representations of trees in mosaic graphs with faces instead of vertices and with common sides of faces instead of the corresponding edges are discussed in [3]. It is more challenging in use congruent regular k-gons in plane edge-to-edge packings (no overlappings) where only the points of common sides of the k-gons are allowed to belong to two distinct k-gons. However, the discussion of these realizations of trees becomes much more difficult since now geometry is involved.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bisztriczky, T., Böröczky, K., Harborth, H. and Piepmeyer, L. “On the smallest limited snake of unit disks.” Geometriae Dedicata, Vol. 40 (1991): pp. 319–324.
Harborth, H. “Problem 45: Kleinste endliche Schlange.” Math. Semesterber., Vol. 36 (1989): pp. 269–270.
Harborth, H. and Jäger, S. “Fibonacci and b-adic trees in mosaic graphs.” Applications of Fibonacci Numbers, Volume 4. Edited by G.E. Bergum, A.N. Philippou and A.F. Horadam, Kluwer Acad. Publ., Dordrecht, The Netherlands, 1991, pp. 127–132.
Heidelberg, R., Stege, L. and Weiss, H. “Lösung zu Problem 45.” Math. Semesterber., Vol. 38 (1991): pp. 137–138.
Hering, F. “Beweis einer Vermutung von Heiko Harborth über Polyominoes aus Quadraten.” Math. Semesterber., Vol. 38 (1991): pp. 223–237.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Harborth, H. (1993). Problems on Fibonacci and B-Adic Tree Representations by Regular K-Gons. In: Bergum, G.E., Philippou, A.N., Horadam, A.F. (eds) Applications of Fibonacci Numbers. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-2058-6_26
Download citation
DOI: https://doi.org/10.1007/978-94-011-2058-6_26
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-4912-2
Online ISBN: 978-94-011-2058-6
eBook Packages: Springer Book Archive