Geometric finiteness and uniqueness for Kleinian groups with circle packing limit sets.
Linda Keen, Bernard Maskit (1993)
Journal für die reine und angewandte Mathematik
Similarity:
Linda Keen, Bernard Maskit (1993)
Journal für die reine und angewandte Mathematik
Similarity:
H. Groemer (1990)
Discrete & computational geometry
Similarity:
Kuperberg, Greg (2000)
Geometry & Topology
Similarity:
Fodor, Ferenc (2000)
Beiträge zur Algebra und Geometrie
Similarity:
Schürmann, Achill (2000)
Beiträge zur Algebra und Geometrie
Similarity:
Vassallo, Salvatore, Wills, Jörg M. (1994)
Beiträge zur Algebra und Geometrie
Similarity:
Z. Füredi (1991)
Discrete & computational geometry
Similarity:
Schürmann, Achill (2006)
Documenta Mathematica
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. ...
Bobenko, Alexander I., Hoffmann, Tim (2001)
Experimental Mathematics
Similarity:
Graham, R.L., Lubachevsky, B.D. (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hans Melissen (1994)
Elemente der Mathematik
Similarity: