The k-distance coloring and k-distance edge coloring on double graph of paths

DOI

10.2991/gcmce-17.2017.17How to use a DOI?

Keywords

path, k-distance colorings, k-distance edge colorings, double graphs, semistrong product.

Abstract

In this paper, we study the -distance colorings and -distance edge colorings of path double graphs which are based on the semistrong product. We shows that two formulas about -distance and -distance edge chromatic number of path double graphs vary with .

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Susu Jiao
AU  - Shuangliang Tian
AU  - Xiahong Cai
AU  - Huan Yang
PY  - 2017/06
DA  - 2017/06
TI  - The k-distance coloring and k-distance edge coloring on double graph of paths
BT  - Proceedings of the 2017 Global Conference on Mechanics and Civil Engineering (GCMCE 2017)
PB  - Atlantis Press
SP  - 88
EP  - 91
SN  - 2352-5401
UR  - https://doi.org/10.2991/gcmce-17.2017.17
DO  - 10.2991/gcmce-17.2017.17
ID  - Jiao2017/06
ER  -