当前位置:
X-MOL 学术
›
Theor. Comput. Sci.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
List r-dynamic coloring of sparse graphs
Theoretical Computer Science ( IF 1.1 ) Pub Date : 2019-07-02 , DOI: 10.1016/j.tcs.2019.05.032 Junlei Zhu , Yuehua Bu
中文翻译:
稀疏图的列表r动态着色
更新日期:2019-07-02
Theoretical Computer Science ( IF 1.1 ) Pub Date : 2019-07-02 , DOI: 10.1016/j.tcs.2019.05.032 Junlei Zhu , Yuehua Bu
The r-dynamic coloring is a generalization of the -labeling. An r-dynamic k-coloring of a graph G is a proper k-coloring such that every vertex v in has neighbors in at least different classes. The r-dynamic chromatic number of G, written , is the minimum k such that G has such a coloring. The list r-dynamic chromatic number of G is denoted . In this paper, we show that for planar graphs G with and , for graphs G with and for graphs G with and .
中文翻译:
稀疏图的列表r动态着色
所述ř -dynamic着色的一般化-标签。图G的r动态k着色是适当的k着色,使得每个顶点v in 至少有邻居 不同的类别。所述ř的-dynamic色数ģ,写入是使G具有这种颜色的最小值k。G的列表r-动态色数表示。在本文中,我们表明为平面图ģ与 和 , 对于图G与 和 对于图G与 和 。