On the distance and multidistance graph embeddability problem

DOI10.1134/S1064562416030121zbMath1348.05069MaRDI QIDQ334409

M. I. Tikhomirov

Publication date: 1 November 2016

Published in: Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

distance graph in \(\mathbb{R}^d\)

Mathematics Subject Classification ID

Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Estimate of the number of edges in special subgraphs of a distance graph

Cites Work

• Unnamed Item
• Unnamed Item
• On the chromatic numbers of spheres in \(\mathbb R^n\)
• On the chromatic numbers of spheres in Euclidean spaces
• On the complexity of H-coloring
• On the complexity of finding iso- and other morphisms for partial \(k\)- trees
• The complexity of infinite \(H\)-colouring
• Borsuk's problem and the chromatic numbers of some metric spaces
• Coloring Distance Graphs and Graphs of Diameters
• Realizability of Graphs and Linkages
• On the Computational Complexity of Degenerate Unit Distance Representations of Graphs
• Research Problems in Discrete Geometry
• On Sets of Distances of n Points