2 papers
cs.CC2017
On complexity of mutlidistance graph recognition in
Mikhail Tikhomirov
Let be a set of positive numbers. A graph is called an -embeddable graph in if the vertices of can be positioned in …
cs.CC2014
On computational complexity of length embeddability of graphs
Mikhail Tikhomirov
A graph is embeddable in if vertices of can be assigned with points of in such a way that all pairs of adjacent vertices are at the distance 1…