%0 Journal Article
%T The Vertex Linear Arboricity of the Integre Distance Graph G(Dm,k,2)<br>整数距离图G(Dm,k,2)的点线性荫度
%A Zuo Liancui
%A Wu Jianliang
%A Liu Jiazhuang
%A <br>左连翠
%A 吴建良
%A 刘家壮
%J 系统科学与数学
%D 2006
%I 
%X 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...
%K Integer distance graph
%K vertex linear arboricity
%K path coloring<br>整数距离图
%K 点线性荫度
%K 路着色
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=02507C9717F2B9ED&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=94C357A881DFC066&sid=91BAD12CFABB3251&eid=640CCB6E396307A8&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=16