Results 1 to 10 of about 303 (159)
The Rainbow (Vertex) Connection Number of Pencil Graphs
Procedia Computer Science, 2015 An edge colored graph G = (V(G), E(G)) is said rainbow connected, if any two vertices are connnected by a path whose edges have distinct colors. The rainbow connection number of G, denoted by rc(G), is the smallest positive integer of colors needed in ...
A N M Salman
exaly +3 more sources
The complexity of determining the rainbow vertex-connection of a graph
Theoretical Computer Science, 2011 A vertex-colored graph is rainbow vertex-connected if any two vertices are connected by a path whose internal vertices have distinct colors, which was introduced by Krivelevich and Yuster.
Lily Chen, Xueliang Li, Yongtang Shi
exaly +4 more sources
Rainbow Vertex-Connection and Forbidden Subgraphs
Discussiones Mathematicae Graph Theory, 2018 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 ...
Li Xueliang, Li Wenjing, Zhang Jingshu
core +7 more sources
Desimal: Jurnal Matematika, 2021 A graph is said rainbow connected if no path has more than one vertices of the same color inside. The minimum number of colors required to make a graph to be rainbow vertex-connected is called rainbow vertex connection-number and denoted by rvc(G ...
Akadji, Afifah Farhanah +3 more
core +3 more sources
The Vertex-Rainbow Connection Number of Some Graph Operations
Discussiones Mathematicae Graph Theory, 2021 A path in an edge-colored (respectively vertex-colored) graph G is rainbow (respectively vertex-rainbow) if no two edges (respectively internal vertices) of the path are colored the same.
Ma Yingbin +5 more
core +3 more sources
Rainbow vertex connection of digraphs [PDF]
Journal of Combinatorial Optimization, 2017 22 pages, 3 ...
Yongtang Shi, Shi Yongtang
exaly +3 more sources
On the Rainbow Vertex-Connection
Discussiones Mathematicae Graph Theory, 2013 A vertex-colored graph is rainbow vertex-connected if any two vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex-connection of a connected graph G, denoted by rvc(G), is the smallest number of colors that ...
Shi Yongtang +3 more
core +4 more sources
BAREKENG: Jurnal Ilmu Matematika dan Terapan, 2023 Rainbow vertex-connection number is the minimum colors assignment to the vertices of the graph, such that each vertex is connected by a path whose edges have distinct colors and is denoted by .
Nurwan, Nurwan +7 more
core +3 more sources
Tight upper bound of the rainbow vertex-connection number for 2-connected graphs
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xueliang Li, Sujuan Liu
exaly +2 more sources
Further hardness results on the rainbow vertex-connection number of graphs
Theoretical Computer Science, 2013 A vertex-colored graph $G$ is {\it rainbow vertex-connected} if any pair of vertices in $G$ are connected by a path whose internal vertices have distinct colors, which was introduced by Krivelevich and Yuster. The {\it rainbow vertex-connection number} of a connected graph $G$, denoted by $rvc(G)$, is the smallest number of colors that are needed in ...
Lily Chen, Xueliang Li
exaly +4 more sources