Abstract: 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 of a connected graph , denoted by , is the smallest number of colors that are needed in order to make rainbow connected. In this paper, we proved that for all -connected graphs.
Recommendations
Cites work
Cited in
(41)- Color-connected graphs and information-transfer paths
- Generalized rainbow connection of graphs
- Hardness results for total rainbow connection of graphs
- Rainbow connection number of graphs with diameter 3
- Rainbow connections for outerplanar graphs with diameter 2 and 3
- Bounds for the rainbow connection number of graphs
- Coupon coloring of cographs
- Rainbow connection number, bridges and radius
- Rainbow connection number and connectivity
- Upper bounds of proper connection number of graphs
- Finite families of forbidden subgraphs for rainbow connection in graphs
- Nordhaus-Gaddum-type theorem for rainbow connection number of graphs
- (Strong) rainbow connection on the splitting of 3-path
- Graphs with small total rainbow connection number
- Rainbow connection in graphs with minimum degree three
- The generalized 3-connectivity of star graphs and bubble-sort graphs
- Characterize graphs with rainbow connection numbers \(m-2\) and \(m-3\)
- Injective coloring of some graph operations
- Note on the hardness of rainbow connections for planar and line graphs
- Rainbow connection for some families of hypergraphs
- The vertex-rainbow connection number of some graph operations
- Rainbow \(k\)-connection in dense graphs (extended abstract)
- Rainbow connectivity of Moore cages of girth 6
- Long rainbow paths and rainbow cycles in edge colored graphs. A survey
- Rainbow connection in graphs
- Rainbow connection number two and clique number
- Rainbow connection numbers of middle and total graphs
- The complexity of determining the vertex-rainbow index of graphs
- Rainbow connection in some digraphs
- Rainbow connectivity of linear polygon chains
- Upper bounds for the rainbow connection numbers of line graphs
- Coupon coloring of some special graphs
- On 2-rainbow domination of generalized Petersen graphs
- Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\)
- Proper connection numbers of complementary graphs
- Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs
- Rainbow and monochromatic vertex-connection of random graphs
- Generalized rainbow connection of graphs and their complements
- Proper connection number and connected dominating sets
- Strong rainbow coloring of unicyclic graphs
- Rainbow connection numbers of line graphs.
This page was built for publication: Rainbow connection in 3-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367069)
