EuDML | Browse

Processing math: 0%

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 7 of 7

Packing 10 or 11 unit squares in a square.

Stromquist, Walter (2003)

The Electronic Journal of Combinatorics [electronic only]

Packing graphs: The packing problem solved.

Caro, Yair, Yuster, Raphael (1997)

The Electronic Journal of Combinatorics [electronic only]

Packing of 180 equal circles on a sphere.

Tibor Tarnai (1983)

Elemente der Mathematik

Packing unit squares in squares: A survey and new results.

Friedman, Erich (1998)

The Electronic Journal of Combinatorics [electronic only]

Packings of pairs with a minimum known number of quadruples

Jiří Novák (1995)

Mathematica Bohemica

Let $E$ be an $n$ -set. The problem of packing of pairs on $E$ with a minimum number of quadruples on $E$ is settled for $n < 15$ and also for $n = 36 t + i$ , $i = 3$ , $6$ , $9$ , $12$ , where $t$ is any positive integer. In the other cases of $n$ methods have been presented for constructing the packings having a minimum known number of quadruples.

Packungen kongruenter Stäbchen mit konstanter Nachbarnzahl.

J. Linhart, F. Österreicher (1982)

Elemente der Mathematik

Penny-Packing and Two-Dimensional Codes.

N.J.A. Sloane, R.L. Graham (1990)

Discrete & computational geometry

Currently displaying 1 – 7 of 7

Page 1