Extremal Packing and Covering Sets.
Rajinder Jeet Hans (1967)
Monatshefte für Mathematik
Similarity:
Rajinder Jeet Hans (1967)
Monatshefte für Mathematik
Similarity:
Imre Bárány, N.P. Dolbilin (1988)
Monatshefte für Mathematik
Similarity:
Wolfgang Schmidt (1961)
Monatshefte für Mathematik
Similarity:
P. Frankl, J. Pach, V. Rödl (1984)
Monatshefte für Mathematik
Similarity:
Károly, Jr. Böröczky (1994)
Monatshefte für Mathematik
Similarity:
H. Groemer (1986)
Monatshefte für Mathematik
Similarity:
Kuperberg, Greg (2000)
Geometry & Topology
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:
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:
Schürmann, Achill (2000)
Beiträge zur Algebra und Geometrie
Similarity: