- Tytuł:
- Vertex-distinguishing edge-colorings of linear forests
- Autorzy:
-
Cichacz, Sylwia
Przybyło, Jakub - Powiązania:
- https://bibliotekanauki.pl/articles/744522.pdf
- Data publikacji:
- 2010
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
irregular edge-coloring
vertex-distinguishing edge-coloring
point-distinguishing chromatic index - Opis:
- In the PhD thesis by Burris (Memphis (1993)), a conjecture was made concerning the number of colors c(G) required to edge-color a simple graph G so that no two distinct vertices are incident to the same multiset of colors. We find the exact value of c(G) - the irregular coloring number, and hence verify the conjecture when G is a vertex-disjoint union of paths. We also investigate the point-distinguishing chromatic index, χ₀(G), where sets, instead of multisets, are required to be distinct, and determine its value for the same family of graphs.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2010, 30, 1; 95-103
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki