Zobrazeno 1 - 8 of 8 pro vyhledávání: '"L. W. Beineke"'
1
Enumerating Dissectible Polyhedra by Their Automorphism Groups
Autor: L. W. Beineke, R. E. Pippert
Publikováno v: Canadian Journal of Mathematics. 26:50-67
A dissectible polyhedron is a natural extension of a concept whose history dates back to at least 1758 and Euler [7]—the concept of a dissection of a polygon. An interesting historical survey of dissections of a polygon is given by Brown [4]. Some
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::4686281135b892807880ffb616d139d4
https://doi.org/10.4153/cjm-1974-006-x
Zobrazit plný text záznamu
2
On the enumeration of planar trees of hexagons
Autor: L. W. Beineke, R. E. Pippert
Publikováno v: Glasgow Mathematical Journal. 15:131-147
In their paper “ The enumeration of tree-like polyhexes”, Harary and Read [6] consider structures obtained by assembling hexagons subject to certain restrictions. Their problem is introduced as a simplified hexagonal cell-growth problem.
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::bbba7e35480bb3cf7b33a8555e31a599
https://doi.org/10.1017/s0017089500002305
Zobrazit plný text záznamu
5
Minimal Decompositions of Complete Graphs into Subgraphs with Embeddability Properties
Autor: L. W. Beineke
Publikováno v: Canadian Journal of Mathematics. 21:992-1000
Although the problem of finding the minimum number of planar graphs into which the complete graph can be decomposed remains partially unsolved, the corresponding problem can be solved for certain other surfaces. For three, the torus, the double-torus
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::091a2632d8034c5e319737052ad25d4e
https://doi.org/10.4153/cjm-1969-109-4
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje