On the contact dimensions of graphs

DOI10.1007/BF02187899zbMath0625.05048MaRDI QIDQ579284

Peter Frankl, Hiroshi Maehara

Publication date: 1988

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131038

zbMATH Keywords

Euclidean spacespherescontact dimensiongeometrical embedding

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99) Euclidean geometries (general) and generalizations (51M05)

Related Items

On the Complexity of Closest Pair via Polar-Pair of Point-Sets, The geometry of graphs and some of its algorithmic applications, The Johnson-Lindenstrauss lemma and the sphericity of some graphs, On closest pair in Euclidean metric: monochromatic is as hard as bichromatic, Representations of graphs and networks (coding, layouts and embeddings), Embeddings of graphs in Euclidean spaces, On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic, On the Complexity of Closest Pair via Polar-Pair of Point-Sets, Dispersed points and geometric embedding of complete bipartite graphs

Cites Work

• Contact patterns of equal nonoverlapping spheres
• Explicit construction of exponential sized families of k-independent sets
• Geometrical embeddings of graphs
• Unnamed Item
• Unnamed Item