On rainbow connection
From MaRDI portal
Publication:1010776
zbMath1181.05037MaRDI QIDQ1010776
Yair Caro, Yehuda Roditty, Raphael Yuster, Zsolt Tuza, Arieh Lev
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/117241
Related Items (85)
The 3-rainbow index and connected dominating sets ⋮ Hardness results for total rainbow connection of graphs ⋮ Rainbow connections for outerplanar graphs with diameter 2 and 3 ⋮ Finite families of forbidden subgraphs for rainbow connection in graphs ⋮ Note on the upper bound of the rainbow index of a graph ⋮ Sufficient conditions for 2-rainbow connected graphs ⋮ Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs ⋮ Upper bounding rainbow connection number by forest number ⋮ Rainbow Connection of Random Regular Graphs ⋮ On the Fine-Grained Complexity of Rainbow Coloring ⋮ Some results on the 3-total-rainbow index ⋮ Rainbow connection number, bridges and radius ⋮ Rainbow connection number and connected dominating sets ⋮ Some remarks on rainbow connectivity ⋮ Upper bounds for the total rainbow connection of graphs ⋮ Rainbow connection number and independence number of a graph ⋮ Rainbow colouring of split graphs ⋮ Proper rainbow connection number of graphs ⋮ The strong 3-rainbow index of edge-comb product of a path and a connected graph ⋮ Rainbow connection in 3-connected graphs ⋮ On the rainbow connectivity of graphs: complexity and FPT algorithms ⋮ The strong 3-rainbow index of some certain graphs and its amalgamation ⋮ Proper connection of direct products ⋮ Rainbow connection numbers of Cayley graphs ⋮ The rainbow connection number of 2-connected graphs ⋮ Further hardness results on the rainbow vertex-connection number of graphs ⋮ Upper bounds for the rainbow connection numbers of line graphs ⋮ Unnamed Item ⋮ More on the colorful monochromatic connectivity ⋮ Tight upper bound of the rainbow vertex-connection number for 2-connected graphs ⋮ Rainbow connectivity and rainbow index of inhomogeneous random graphs ⋮ On the complexity of \(k\)-rainbow cycle colouring problems ⋮ Conflict-free connection number of random graphs ⋮ Rainbow connections of graphs: a survey ⋮ Proper connection number of random graphs ⋮ Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 ⋮ A survey on rainbow (vertex-)index of graphs ⋮ Loose edge-connection of graphs ⋮ Rainbow vertex connection of digraphs ⋮ Concentration of rainbow \(k\)-connectivity of a multiplex random graph ⋮ Strong rainbow connection in digraphs ⋮ On rainbow-\(k\)-connectivity of random graphs ⋮ The complexity of determining the rainbow vertex-connection of a graph ⋮ Proper connection of graphs ⋮ Upper bound involving parameter \(\sigma_2\) for the rainbow connection number ⋮ Properly colored paths and cycles ⋮ Rainbow connection and minimum degree ⋮ Rainbow connection for some families of hypergraphs ⋮ Rainbow connection in oriented graphs ⋮ The vertex-rainbow connection number of some graph operations ⋮ On forbidden subgraphs and rainbow connection in graphs with minimum degree 2 ⋮ The \(k\)-proper index of graphs ⋮ Rainbow connection number of graph power and graph products ⋮ Rainbow connection number and the number of blocks ⋮ Hardness and algorithms for rainbow connection ⋮ On total rainbow \(k\)-connected graphs ⋮ Multicolorful connectivity of trees ⋮ Erdős-Gallai-type results for colorful monochromatic connectivity of a graph ⋮ Rainbow connections in digraphs ⋮ Rainbow paths ⋮ The 3-rainbow index of a graph ⋮ Graphs with 3-rainbow index \(n-1\) and \(n-2\) ⋮ Unnamed Item ⋮ The (vertex-)monochromatic index of a graph ⋮ Rainbow connection and graph products ⋮ The rainbow connection of a graph is (at most) reciprocal to its minimum degree ⋮ Colorful monochromatic connectivity ⋮ Rainbow \(k\)-connectivity of random bipartite graphs ⋮ The complexity of determining the vertex-rainbow index of graphs ⋮ On various (strong) rainbow connection numbers of graphs ⋮ More on the minimum size of graphs with given rainbow index ⋮ The vertex-rainbow index of a graph ⋮ On the threshold for rainbow connection number \(r\) in random graphs ⋮ Rainbow connection number and radius ⋮ Generalized rainbow connectivity of graphs ⋮ Note on the vertex-rainbow index of a graph ⋮ Further results on the rainbow vertex-disconnection of graphs ⋮ Fine-grained complexity of rainbow coloring and its variants ⋮ On strong proper connection number of cubic graphs ⋮ Fine-Grained Complexity of Rainbow Coloring and its Variants. ⋮ Rainbow and monochromatic vertex-connection of random graphs ⋮ Graphs with 4-rainbow index 3 and \(n-1\) ⋮ Rainbow connection and forbidden subgraphs ⋮ Note on the hardness of rainbow connections for planar and line graphs ⋮ The \((k,\ell)\)-rainbow index of random graphs
This page was built for publication: On rainbow connection
