- Tytuł:
- Conflict-Free Vertex-Connections of Graphs
- Autorzy:
-
Li, Xueliang
Zhang, Yingying
Zhu, Xiaoyu
Mao, Yaping
Zhao, Haixing
Jendrol’, Stanislav - Powiązania:
- https://bibliotekanauki.pl/articles/31868621.pdf
- Data publikacji:
- 2020-02-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
vertex-coloring
conflict-free vertex-connection
2-connected graph
tree - Opis:
- A path in a vertex-colored graph is called conflict-free if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be conflict-free vertex-connected if any two vertices of the graph are connected by a conflict-free path. This paper investigates the question: for a connected graph G, what is the smallest number of colors needed in a vertex-coloring of G in order to make G conflict-free vertex-connected. As a result, we get that the answer is easy for 2-connected graphs, and very difficult for connected graphs with more cut-vertices, including trees.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2020, 40, 1; 51-65
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł