On the computational complexity of degenerate unit distance representations of graphs - Mathematics > CombinatoricsReportar como inadecuado




On the computational complexity of degenerate unit distance representations of graphs - Mathematics > Combinatorics - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: Some graphs admit drawings in the Euclidean k-space in such a natu- ralway, that edges are represented as line segments of unit length. Such drawingswill be called k dimensional unit distance representations. When twonon-adjacent vertices are drawn in the same point, we say that therepresentation is degenerate. The dimension the Euclidean dimension of agraph is defined to be the minimum integer k needed that a given graph hasnon-degenerate k dimensional unit distance representation with the propertythat non-adjacent vertices are mapped to points, that are not distance oneappart. It is proved that deciding if an input graph is homomorphic to a graphwith dimension k >= 2 with the Euclidean dimension k >= 2 are NP-hardproblems.



Autor: Jan Kratochvil, Boris Horvat, Tomaz Pisanski

Fuente: https://arxiv.org/







Documentos relacionados