- Tytuł:
- Rainbow Vertex-Connection and Forbidden Subgraphs
- Autorzy:
-
Li, Wenjing
Li, Xueliang
Zhang, Jingshu - Powiązania:
- https://bibliotekanauki.pl/articles/31342433.pdf
- Data publikacji:
- 2018-02-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
vertex-rainbow path
rainbow vertex-connection
forbidden sub-graphs - Opis:
- A path in a vertex-colored graph is called vertex-rainbow if its internal vertices have pairwise distinct colors. A vertex-colored graph G is rainbow vertex-connected if for any two distinct vertices of G, there is a vertex-rainbow path connecting them. For a connected graph G, the rainbow vertex-connection number of G, denoted by rvc(G), is defined as the minimum number of colors that are required to make G rainbow vertex-connected. In this paper, we find all the families ℱ of connected graphs with |ℱ| ∈ {1, 2}, for which there is a constant kℱ such that, for every connected ℱ-free graph G, rvc(G) ≤ diam(G) + kℱ, where diam(G) is the diameter of G.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2018, 38, 1; 143-154
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł