Recommendations
Cites work
- scientific article; zbMATH DE number 3848141 (Why is no real title available?)
- scientific article; zbMATH DE number 3579615 (Why is no real title available?)
- Contact patterns of equal nonoverlapping spheres
- Explicit construction of exponential sized families of k-independent sets
- Geometrical embeddings of graphs
Cited in
(17)- On the complexity of closest pair via polar-pair of point-sets
- scientific article; zbMATH DE number 2100931 (Why is no real title available?)
- On the complexity of closest pair via polar-pair of point-sets
- On Triangle Contact Graphs
- The Johnson-Lindenstrauss lemma and the sphericity of some graphs
- Dispersed points and geometric embedding of complete bipartite graphs
- Classes and recognition of curve contact graphs
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
- Contact patterns of equal nonoverlapping spheres
- Multiple edges in M. Kontsevich's graph complexes and computations of the dimensions and Euler characteristics
- Proportional Contact Representations of Planar Graphs
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic
- Embeddings of graphs in Euclidean spaces
- The geometry of graphs and some of its algorithmic applications
- On Contact Graphs with Cubes and Proportional Boxes
- On contact representations of directed planar graphs
- 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)
