Packing a convex domain with similar convex domains

DOI10.1016/0097-3165(84)90024-4zbMATH Open0538.05028OpenAlexW2043154490MaRDI QIDQ793045FDOQ793045

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)

Cites Work

• On packing squares with equal squares

Cited In (3)

• Finite packing and covering by congruent convex domains
• Title not available (Why is that?)
• Title not available (Why is that?)

   Recommendations

• Finite packing and covering by congruent convex domains 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)