Repeated patterns of dense packings of equal disks in a square.
Graham, R.L., Lubachevski, B.D. (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graham, R.L., Lubachevski, B.D. (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Boll, W.David, Donovan, Jerry, Graham, Ronald L., Lubachevsky, Boris D. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Boris D. Lubachevsky, Ron L. Graham, Frank H. Stillinger (2001)
Visual Mathematics
Similarity:
Fodor, Ferenc (2000)
Beiträge zur Algebra und Geometrie
Similarity:
Gensane, Thierry (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kuperberg, Greg, Kuperberg, Krystyna, Kuperberg, Włodzimierz (2004)
Beiträge zur Algebra und Geometrie
Similarity:
Mukhacheva, È.A., Mukhacheva, A.S. (2004)
Journal of Mathematical Sciences (New York)
Similarity:
I. Sahul Hamid, S. Saravanakumar (2015)
Discussiones Mathematicae Graph Theory
Similarity:
In a graph G = (V,E), a non-empty set S ⊆ V is said to be an open packing set if no two vertices of S have a common neighbour in G. An open packing set which is not a proper subset of any open packing set is called a maximal open packing set. The minimum and maximum cardinalities of a maximal open packing set are respectively called the lower open packing number and the open packing number and are denoted by ρoL and ρo. In this paper, we present some bounds on these parameters. ...
Kuperberg, Greg (2000)
Geometry & Topology
Similarity:
Janusz Januszewski (2002)
Colloquium Mathematicae
Similarity:
The aim of the paper is to find a rectangle with the least area into which each sequence of rectangles of sides not greater than 1 with total area 1 can be packed.
Z. Füredi (1991)
Discrete & computational geometry
Similarity:
Vassallo, Salvatore, Wills, Jörg M. (1994)
Beiträge zur Algebra und Geometrie
Similarity:
P. Schmitt (1991)
Discrete & computational geometry
Similarity: