The k-distance coloring and k-distance edge coloring on double graph of paths
Susu Jiao, Shuangliang Tian, Xiahong Cai, Huan Yang
Available Online June 2017.
- https://doi.org/10.2991/gcmce-17.2017.17How to use a DOI?
- path, k-distance colorings, k-distance edge colorings, double graphs, semistrong product.
- 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 .
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
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 - 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 - https://doi.org/10.2991/gcmce-17.2017.17 ID - Jiao2017/06 ER -