On the distance and multidistance graph embeddability problem
type: Item
instance of: scholarly article
title: On the distance and multidistance graph embeddability problem
zbMATH Open document ID: 1348.05069
DOI: 10.1134/S1064562416030121
author: M. I. Tikhomirov
published in: Doklady Mathematics
publication date: 2016-11-01T00:00:00Z
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 6646125
zbMATH Keywords: distance graph in \(\mathbb{R}^d\)
MaRDI profile type: Publication
cites work: Research Problems in Discrete Geometry
cites work: On Sets of Distances of n Points
cites work: Borsuk's problem and the chromatic numbers of some metric spaces
cites work: Coloring Distance Graphs and Graphs of Diameters
cites work: On the Computational Complexity of Degenerate Unit Distance Representations of Graphs
cites work: Realizability of Graphs and Linkages
cites work: Q3315532
cites work: On the chromatic numbers of spheres in Euclidean spaces
cites work: On the chromatic numbers of spheres in \(\mathbb R^n\)
cites work: Q4142699
cites work: On the complexity of H-coloring
cites work: The complexity of infinite \(H\)-colouring
cites work: On the complexity of finding iso- and other morphisms for partial \(k\)- trees
description: scientific article; zbMATH DE number 6646125