On the contact dimensions of graphs

DOI10.1007/BF02187899zbMATH Open0625.05048MaRDI QIDQ579284FDOQ579284

Authors: Peter Frankl, H. Maehara 

Publication date: 1988

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

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

Recommendations

• Contact patterns of equal nonoverlapping spheres
• scientific article
• Embeddings of graphs in Euclidean spaces
• Contact graphs of unit sphere packings revisited
• On the dimension of a graph

zbMATH Keywords

spheresEuclidean spacecontact 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)

Cites Work

• Title not available (Why is that?)
• Geometrical embeddings of graphs
• Explicit construction of exponential sized families of k-independent sets
• Contact patterns of equal nonoverlapping spheres
• Title not available (Why is that?)

Cited In (17)

• On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
• On Contact Graphs with Cubes and Proportional Boxes
• On closest pair in Euclidean metric: monochromatic is as hard as bichromatic
• Dispersed points and geometric embedding of complete bipartite graphs
• The geometry of graphs and some of its algorithmic applications
• Contact patterns of equal nonoverlapping spheres
• On Triangle Contact Graphs
• Classes and recognition of curve contact graphs
• On contact representations of directed planar graphs
• Proportional Contact Representations of Planar Graphs
• Multiple edges in M. Kontsevich's graph complexes and computations of the dimensions and Euler characteristics
• The Johnson-Lindenstrauss lemma and the sphericity of some graphs
• Embeddings of graphs in Euclidean spaces
• On the complexity of closest pair via polar-pair of point-sets
• On the complexity of closest pair via polar-pair of point-sets
• Title not available (Why is that?)
• Representations of graphs and networks (coding, layouts and embeddings)

This page was built for publication: On the contact dimensions of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579284)