The densest packing of 12 congruent circles in a circle.
Fodor, Ferenc (2000)
Beiträge zur Algebra und Geometrie
Similarity:
Fodor, Ferenc (2000)
Beiträge zur Algebra und Geometrie
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. ...
Vassallo, Salvatore, Wills, Jörg M. (1994)
Beiträge zur Algebra und Geometrie
Similarity:
Mukhacheva, È.A., Mukhacheva, A.S. (2004)
Journal of Mathematical Sciences (New York)
Similarity:
Z. Füredi (1991)
Discrete & computational geometry
Similarity:
Kemnitz, Arnfried, Soltan, Valeriu (1999)
Beiträge zur Algebra und Geometrie
Similarity:
Kuperberg, Greg (2000)
Geometry & Topology
Similarity:
P. Schmitt (1991)
Discrete & computational geometry
Similarity:
Schürmann, Achill (2000)
Beiträge zur Algebra und Geometrie
Similarity:
Boris D. Lubachevsky, Ron L. Graham, Frank H. Stillinger (2001)
Visual Mathematics
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: