Twin chromatic indices of some graphs with maximum degree 3
Let k ≥ 2 be an integer and G be a connected graph of order at least 3. A twin k-edge coloring of G is a proper edge coloring of G that uses colors from k and that induces a proper vertex coloring on G where the color of a vertex v is the sum (in k ) of the colors of the edges incident with v. The...
Saved in:
Main Authors: | , , |
---|---|
格式: | text |
出版: |
Archīum Ateneo
2020
|
主題: | |
在線閱讀: | https://archium.ateneo.edu/mathematics-faculty-pubs/125 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1124&context=mathematics-faculty-pubs |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Ateneo De Manila University |