On Twin Edge Colorings of Graphs
A twin edge k-coloring of a graph G is a proper edge coloring of G with the elements of Zk so that the induced vertex coloring in which the color of a vertex v in G is the sum (in Zk) of the colors of the edges incident with v is a proper vertex coloring. The minimum k for which G has a twin edge k-...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2014-08-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.1756 |
| _version_ | 1797704377952108544 |
|---|---|
| author | Andrews Eric Helenius Laars Johnston Daniel VerWys Jonathon Zhang Ping |
| author_facet | Andrews Eric Helenius Laars Johnston Daniel VerWys Jonathon Zhang Ping |
| author_sort | Andrews Eric |
| collection | DOAJ |
| description | A twin edge k-coloring of a graph G is a proper edge coloring of G with the elements of Zk so that the induced vertex coloring in which the color of a vertex v in G is the sum (in Zk) of the colors of the edges incident with v is a proper vertex coloring. The minimum k for which G has a twin edge k-coloring is called the twin chromatic index of G. Among the results presented are formulas for the twin chromatic index of each complete graph and each complete bipartite graph |
| first_indexed | 2024-03-12T05:19:29Z |
| format | Article |
| id | doaj.art-2f0f64ca7dc34ef9b1dc0117ad739d46 |
| institution | Directory Open Access Journal |
| issn | 2083-5892 |
| language | English |
| last_indexed | 2024-03-12T05:19:29Z |
| publishDate | 2014-08-01 |
| publisher | University of Zielona Góra |
| record_format | Article |
| series | Discussiones Mathematicae Graph Theory |
| spelling | doaj.art-2f0f64ca7dc34ef9b1dc0117ad739d462023-09-03T07:47:15ZengUniversity of Zielona GóraDiscussiones Mathematicae Graph Theory2083-58922014-08-0134361362710.7151/dmgt.1756dmgt.1756On Twin Edge Colorings of GraphsAndrews Eric0Helenius Laars1Johnston Daniel2VerWys Jonathon3Zhang Ping4Department of Mathematics Western Michigan University Kalamazoo, MI 49008, USADepartment of Mathematics Western Michigan University Kalamazoo, MI 49008, USADepartment of Mathematics Western Michigan University Kalamazoo, MI 49008, USADepartment of Mathematics Western Michigan University Kalamazoo, MI 49008, USADepartment of Mathematics Western Michigan University Kalamazoo, MI 49008, USAA twin edge k-coloring of a graph G is a proper edge coloring of G with the elements of Zk so that the induced vertex coloring in which the color of a vertex v in G is the sum (in Zk) of the colors of the edges incident with v is a proper vertex coloring. The minimum k for which G has a twin edge k-coloring is called the twin chromatic index of G. Among the results presented are formulas for the twin chromatic index of each complete graph and each complete bipartite graphhttps://doi.org/10.7151/dmgt.1756edge coloringvertex coloringfactorization |
| spellingShingle | Andrews Eric Helenius Laars Johnston Daniel VerWys Jonathon Zhang Ping On Twin Edge Colorings of Graphs Discussiones Mathematicae Graph Theory edge coloring vertex coloring factorization |
| title | On Twin Edge Colorings of Graphs |
| title_full | On Twin Edge Colorings of Graphs |
| title_fullStr | On Twin Edge Colorings of Graphs |
| title_full_unstemmed | On Twin Edge Colorings of Graphs |
| title_short | On Twin Edge Colorings of Graphs |
| title_sort | on twin edge colorings of graphs |
| topic | edge coloring vertex coloring factorization |
| url | https://doi.org/10.7151/dmgt.1756 |
| work_keys_str_mv | AT andrewseric ontwinedgecoloringsofgraphs AT heleniuslaars ontwinedgecoloringsofgraphs AT johnstondaniel ontwinedgecoloringsofgraphs AT verwysjonathon ontwinedgecoloringsofgraphs AT zhangping ontwinedgecoloringsofgraphs |