On Twin Edge Colorings Of Finite 2-Dimensional Grids
Huan Yang, Shuangliang Tian, Xiahong Cai, Su Su Jiao
Available Online June 2017.
- https://doi.org/10.2991/gcmce-17.2017.13How to use a DOI?
- Twin edge coloring, Twin chromatic number, Finite 2-dimensional grids.
- Let be a proper edge coloring of a connected graph of order at least 3, where the color set is . If can induce a proper vertex coloring of , then is called a twin edge -coloring of . The minimum number of colors for which has a twin edge coloring is called the twin chromatic index of . In this paper, twin edge colorings of finite 2-dimensional grids are studied, and it's twin chromatic number is obtained.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Huan Yang AU - Shuangliang Tian AU - Xiahong Cai AU - Su Su Jiao PY - 2017/06 DA - 2017/06 TI - On Twin Edge Colorings Of Finite 2-Dimensional Grids BT - 2017 Global Conference on Mechanics and Civil Engineering (GCMCE 2017) PB - Atlantis Press SP - 67 EP - 72 SN - 2352-5401 UR - https://doi.org/10.2991/gcmce-17.2017.13 DO - https://doi.org/10.2991/gcmce-17.2017.13 ID - Yang2017/06 ER -