The vertex linear arboricity of distance graphs |
| |
Authors: | Lian-Cui Zuo Jia-Liang Wu |
| |
Institution: | a Center of Combinatorics, Nankai University, Tianjin, 300071, China b School of Science, Jinan University, Jinan, 250022, China c School of Mathematics, Shandong University, Jinan, 250100, China |
| |
Abstract: | A distance graph is a graph G(R,D) with the set of all points of the real line as vertex set and two vertices u,v∈R are adjacent if and only if |u-v|∈D where the distance set D is a subset of the positive real numbers. Here, the vertex linear arboricity of G(R,D) is determined when D is an interval between 1 and δ. In particular, the vertex linear arboricity of integer distance graphs G(D) is discussed, too. |
| |
Keywords: | Distance graph Vertex linear arboricity Path coloring |
本文献已被 ScienceDirect 等数据库收录! |
|