Optimal substructures in optimal and approximate circle packings.
Szabó, Péter Gábor (2005)
Beiträge zur Algebra und Geometrie
Similarity:
Szabó, Péter Gábor (2005)
Beiträge zur Algebra und Geometrie
Similarity:
Gensane, Thierry (2009)
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:
Alexander Vardy (1995)
Inventiones mathematicae
Similarity:
Schürmann, Achill (2006)
Documenta Mathematica
Similarity:
Graham, R.L., Lubachevski, B.D. (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fodor, Ferenc (2000)
Beiträge zur Algebra und Geometrie
Similarity:
J.H. Conway, N.J.A. Sloane (1995)
Discrete & computational geometry
Similarity:
Vassallo, Salvatore, Wills, Jörg M. (1994)
Beiträge zur Algebra und Geometrie
Similarity:
Kuperberg, Greg (2000)
Geometry & Topology
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. ...
Graham, R.L., Lubachevsky, B.D. (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Aleksandar Savić, Tijana Šukilović, Vladimir Filipović (2011)
The Yugoslav Journal of Operations Research
Similarity: