Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Rainbow connections of graphs: A survey
X Li, Y Shi, Y Sun - Graphs and combinatorics, 2013 - Springer
The concept of rainbow connection was introduced by Chartrand et al.[14] in 2008. It is
interesting and recently quite a lot papers have been published about it. In this survey we …
interesting and recently quite a lot papers have been published about it. In this survey we …
An updated survey on rainbow connections of graphs-a dynamic survey
X Li, Y Sun - Theory and Applications of Graphs, 2017 - digitalcommons.georgiasouthern …
The concept of rainbow connection was introduced by Chartrand, Johns, McKeon and
Zhang in 2008. Nowadays it has become a new and active subject in graph theory. There is …
Zhang in 2008. Nowadays it has become a new and active subject in graph theory. There is …
On the rainbow antimagic coloring of vertex amalgamation of graphs
The purpose of this study is to develop rainbow antimagic coloring. This study is a
combination of two notions, namely antimagic and rainbow concept. If every vertex of graph …
combination of two notions, namely antimagic and rainbow concept. If every vertex of graph …
Rainbow connection number and radius
The rainbow connection number, rc (G), of a connected graph G is the minimum number of
colours needed to colour its edges, so that every pair of its vertices is connected by at least …
colours needed to colour its edges, so that every pair of its vertices is connected by at least …
Rainbow connection number of graph power and graph products
Rainbow connection number, rc (G), of a connected graph G is the minimum number of
colors needed to color its edges so that every pair of vertices is connected by at least one …
colors needed to color its edges so that every pair of vertices is connected by at least one …
Rainbow connection numbers of Cayley graphs
Y Ma, Z Lu - Journal of Combinatorial optimization, 2017 - Springer
An edge colored graph is rainbow connected if any two vertices are connected by a path
whose edges have distinct colors. The rainbow connection number, rc-number for short, of a …
whose edges have distinct colors. The rainbow connection number, rc-number for short, of a …
Rainbow connections for outerplanar graphs with diameter 2 and 3
X Huang, X Li, Y Shi, J Yue, Y Zhao - Applied Mathematics and …, 2014 - Elsevier
An edge-colored graph G is rainbow connected if every two vertices are connected by a path
whose edges have distinct colors. The rainbow connection number of a connected graph G …
whose edges have distinct colors. The rainbow connection number of a connected graph G …
[HTML][HTML] Tight upper bound of the rainbow vertex-connection number for 2-connected graphs
X Li, S Liu - Discrete Applied Mathematics, 2014 - Elsevier
The rainbow vertex-connection number, rvc (G), of a connected graph G is the minimum
number of colors needed to color its vertices such that every pair of vertices is connected by …
number of colors needed to color its vertices such that every pair of vertices is connected by …
Note on the hardness of rainbow connections for planar and line graphs
X Huang, X Li, Y Shi - Bulletin of the Malaysian Mathematical Sciences …, 2015 - Springer
An edge-colored graph GG is rainbow connected if every two vertices are connected by a
path whose edges have distinct colors. It is known that deciding whether a given edge …
path whose edges have distinct colors. It is known that deciding whether a given edge …
[HTML][HTML] The rainbow connection number of 2-connected graphs
J Ekstein, P Holub, T Kaiser, M Koch, SM Camacho… - Discrete …, 2013 - Elsevier
The rainbow connection number of a graph G is the least number of colours in a (not
necessarily proper) edge-colouring of G such that every two vertices are joined by a path …
necessarily proper) edge-colouring of G such that every two vertices are joined by a path …