- Tytuł:
- Conflict-Free Connections of Graphs
- Autorzy:
-
Czap, Július
Jendroľ, Stanislav
Valiska, Juraj - Powiązania:
- https://bibliotekanauki.pl/articles/31342254.pdf
- Data publikacji:
- 2018-11-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
edge-coloring
conflict-free connection
2-edge-connected graph
tree - Opis:
- An edge-colored graph G is conflict-free connected if any two of its vertices are connected by a path, which contains a color used on exactly one of its edges. In this paper the question for the smallest number of colors needed for a coloring of edges of G in order to make it conflict-free connected is investigated. We show that the answer is easy for 2-edge-connected graphs and very difficult for other connected graphs, including trees.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2018, 38, 4; 911-920
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł