On the distance and multidistance graph embeddability problem
From MaRDI portal
Recommendations
- On complexity of multidistance graph recognition in \(\mathbb{R}^1\)
- On computational complexity of length embeddability of graphs
- A divide-and-conquer strategy for embedding a distance-net point set into \(E^ n\) and its application
- scientific article; zbMATH DE number 179280
- Embedding Euclidean distance graphs in \(\mathbb{R}^n\) and \(\mathbb{Q}^n\)
Cites work
- scientific article; zbMATH DE number 3845607 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring distance graphs and graphs of diameters
- On Sets of Distances of n Points
- On the chromatic numbers of spheres in Euclidean spaces
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- On the complexity of H-coloring
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- On the computational complexity of degenerate unit distance representations of graphs
- Realizability of graphs and linkages
- Research Problems in Discrete Geometry
- The complexity of infinite \(H\)-colouring
Cited in
(13)- On computational complexity of length embeddability of graphs
- Distance between graphs using graph labelings.
- scientific article; zbMATH DE number 6780707 (Why is no real title available?)
- Complexity of recognizing multidistance graphs in \(\mathbb{R}^d\)
- scientific article; zbMATH DE number 1890143 (Why is no real title available?)
- On distance subgraphs of graphs in spaces of lower dimensions
- A linear-space algorithm for distance preserving graph embedding
- Connectedness of finite distance graphs
- Notes on models for distance coloring problems
- On complexity of multidistance graph recognition in \(\mathbb{R}^1\)
- A divide-and-conquer strategy for embedding a distance-net point set into \(E^ n\) and its application
- On the computational complexity of degenerate unit distance representations of graphs
- Estimate of the number of edges in special subgraphs of a distance graph
This page was built for publication: On the distance and multidistance graph embeddability problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q334409)
