Packing a convex domain with similar convex domains

DOI10.1016/0097-3165(84)90024-4MaRDI QIDQ793045zbMATH OpenOpenAlexFDO

Authors Sylvia Halász

Publication date 1984

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(84)90024-4

zbMATH Keywords

convex domainsmaximal sum of circumferences

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of packing and covering (05B40)

Recommendations

• Finite packing and covering by congruent convex domains
• scientific article; zbMATH DE number 3911185
• scientific article; zbMATH DE number 3884883
• scientific article; zbMATH DE number 1439492
• scientific article; zbMATH DE number 2058505

Cites work

• On packing squares with equal squares

Cited in

(4)

• Finite packing and covering by congruent convex domains
• scientific article; zbMATH DE number 1234829 (Why is no real title available?)
• Inextensible domains
• scientific article; zbMATH DE number 3055550 (Why is no real title available?)

This page was built for publication: Packing a convex domain with similar convex domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q793045)