On Twin Edge Colorings Of Finite 2-Dimensional Grids

DOI

10.2991/gcmce-17.2017.13How to use a DOI?

Keywords

Twin edge coloring, Twin chromatic number, Finite 2-dimensional grids.

Abstract

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.

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  - 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  - Proceedings of the 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  - 10.2991/gcmce-17.2017.13
ID  - Yang2017/06
ER  -