Abt. Diskrete Mathematik, Techn. Universität Braunschweig, D-38106 Braunschweig, GermanyMathematical Institute, Academy of Sciences of Moldova, MD-2028 Chisinau, Moldova
Abstract: A family $\{C_1,...,C_n\}$ of pairwise distinct, non-overlapping, congruent circles in the plane form a lace provided $C_i$ touches $C_{i+1}$ for all $i = 1,\ldots,n-1$. If, additionally, $C_n$ touches $C_1$, the lace is named a loop. A lace (loop) $\{C_1,\ldots, C_n\}$ is called extendable if it is properly contained in another lace (respectively, loop). In the paper various problems and results on minimum lengths of non-extendable laces and loops are discussed.
Keywords: finite packing, circles, plane
Classification (MSC91): 52C15
Full text of the article: