- Tytuł:
- On twin edge colorings of graphs
- Autorzy:
-
Andrews, Eric
Helenius, Laars
Johnston, Daniel
VerWys, Jonathon
Zhang, Ping - Powiązania:
- https://bibliotekanauki.pl/articles/30148690.pdf
- Data publikacji:
- 2014-08-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
edge coloring
vertex coloring
factorization - Opis:
- A twin edge $k$-coloring of a graph $G$ is a proper edge coloring of $G$ with the elements of $\mathbb{Z}_k$ so that the induced vertex coloring in which the color of a vertex $v$ in $G$ is the sum (in $\mathbb{Z}_k$) 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
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2014, 34, 3; 613-627
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł