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:
Graham, R.L., Lubachevsky, B.D. (1995)
The Electronic Journal of Combinatorics [electronic only]
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. ...
Boll, W.David, Donovan, Jerry, Graham, Ronald L., Lubachevsky, Boris D. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fodor, Ferenc (2000)
Beiträge zur Algebra und Geometrie
Similarity:
Boris D. Lubachevsky, Ron L. Graham, Frank H. Stillinger (2001)
Visual Mathematics
Similarity:
Kuperberg, Greg (2000)
Geometry & Topology
Similarity:
Mukhacheva, È.A., Mukhacheva, A.S. (2004)
Journal of Mathematical Sciences (New York)
Similarity:
Z. Füredi (1991)
Discrete & computational geometry
Similarity:
Aleksandar Savić, Tijana Šukilović, Vladimir Filipović (2011)
The Yugoslav Journal of Operations Research
Similarity:
Szabó, Péter Gábor (2005)
Beiträge zur Algebra und Geometrie
Similarity:
Kuperberg, Greg, Kuperberg, Krystyna, Kuperberg, Włodzimierz (2004)
Beiträge zur Algebra und Geometrie
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.
M. Woźniak (1995)
Discussiones Mathematicae Graph Theory
Similarity:
Let G be a simple graph of order n and size e(G). It is well known that if e(G) ≤ n-2, then there is an edge-disjoint placement of two copies of G into Kₙ. We prove that with the same condition on size of G we have actually (with few exceptions) a careful packing of G, that is an edge-disjoint placement of two copies of G into Kₙ∖Cₙ.