论文信息 - On computational complexity of length embeddability of graphs

On computational complexity of length embeddability of graphs

A graph G is embeddable in R d if the vertices of G can be assigned to points of R d in such a way that all pairs of adjacent vertices are at distance 1. We show that verifying embeddability of a given graph in R d is NP-hard in the case d 2 for all reasonable notions of embeddability.

Mikhail Tikhomirov | M. Tikhomirov

[1] Andrei M. Raigorodskii,et al. On the chromatic numbers of spheres in ℝn , 2012, Comb..

[2] P. Erdös. On Sets of Distances of n Points , 1946 .

[3] Andrei M. Raigorodskii. Cliques and cycles in distance graphs and graphs of diameters , 2013, Discrete Geometry and Algebraic Combinatorics.

[4] A. Raigorodskii. Coloring Distance Graphs and Graphs of Diameters , 2013 .

[5] Andrei Mikhailovich Raigorodskii. On the chromatic numbers of spheres in Euclidean spaces , 2010 .

[6] Андрей Михайлович Райгородский,et al. Проблема Борсука и хроматические числа некоторых метрических пространств@@@Borsuk's problem and the chromatic numbers of some metric spaces , 2001 .

[7] Jan Kratochvíl,et al. On the Computational Complexity of Degenerate Unit Distance Representations of Graphs , 2010, IWOCA.

[8] Paul Erdös,et al. A colour problem for infinite graphs and a problem in the theory of relations , 1951 .

[9] A. Soifer. The Mathematical Coloring Book: Mathematics of Coloring and the Colorful Life of its Creators , 2008 .

[10] János Pach,et al. Research problems in discrete geometry , 2005 .