The vertex linear arboricity of distance graphs

A distance graph is a graph image with the set of all points of the real line as vertex set and two vertices image are adjacent if and only if image where the distance set image is a subset of the positive real numbers. Here, the vertex linear arboricity of image is determined when D is an interval between 1 and image. In particular, the vertex linear arboricity of integer distance graphs image is discussed, too.