The Vertex Linear Arboricity of the Integre Distance Graph G(Dm,k,2)
整数距离图G(Dm,k,2)的点线性荫度

An integer distance graph is a graph $G(D)$ with the set of all integers $Z$ as vertex set and two vertices $u, v \in Z$ are adjacent if and only if $|u - v| \in D$, where the distance set $D$ is a subset of positive integers. Here the vertex linear arboricity of integer distance graph $G(D)$ (denoted by $vla(G(D)))$ is studied. Let $D_{m, k, 2} = \{1, 2, \cdots , m\}\backslash \{k, 2k\}$ for $m \ge 3k$. In this paper, it is obtained that...