On the distance and multidistance graph embeddability problem
From MaRDI portal
Publication:334409
DOI10.1134/S1064562416030121zbMATH Open1348.05069MaRDI QIDQ334409FDOQ334409
Publication date: 1 November 2016
Published in: Doklady Mathematics (Search for Journal in Brave)
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
- Embedding Euclidean distance graphs in \(\mathbb{R}^n\) and \(\mathbb{Q}^n\)
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Distance in graphs (05C12)
Cites Work
- Title not available (Why is that?)
- Research Problems in Discrete Geometry
- On the complexity of H-coloring
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring Distance Graphs and Graphs of Diameters
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- On the chromatic numbers of spheres in Euclidean spaces
- Title not available (Why is that?)
- On Sets of Distances of n Points
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- The complexity of infinite \(H\)-colouring
- Realizability of Graphs and Linkages
- On the Computational Complexity of Degenerate Unit Distance Representations of Graphs
Cited In (5)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A linear-space algorithm for distance preserving graph embedding
- A divide-and-conquer strategy for embedding a distance-net point set into \(E^ n\) and its application
- 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)
