On rainbow connection
From MaRDI portal
Publication:1010776
zbMATH Open1181.05037MaRDI QIDQ1010776FDOQ1010776
Authors: Yair Caro, Yehuda Roditty, Zsolt Tuza, Raphael Yuster, 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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cited In (only showing first 100 items - show all)
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
- The \((k,\ell)\)-rainbow index of random graphs
- Erdős-Gallai-type results for colorful monochromatic connectivity of a graph
- The 3-rainbow index and connected dominating sets
- On the rainbow connectivity of graphs: complexity and FPT algorithms
- Hardness and algorithms for rainbow connection
- Rainbow connection numbers of Cayley graphs
- Bounds for the rainbow connection number of graphs
- Note on minimally \(d\)-rainbow connected graphs
- Upper bound involving parameter \(\sigma_2\) for the rainbow connection number
- Hardness results for total rainbow connection of graphs
- Rainbow connections for outerplanar graphs with diameter 2 and 3
- Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs
- The complexity of determining the rainbow vertex-connection of a graph
- Rainbow connection in 3-connected graphs
- Rainbow vertex connection of digraphs
- Rainbow paths
- Rainbow connections in digraphs
- Rainbow connection number, bridges and radius
- Proper rainbow connection number of graphs
- Rainbow connection number and connectivity
- On the complexity of \(k\)-rainbow cycle colouring problems
- Colorful monochromatic connectivity
- 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
- On the threshold for rainbow connection number \(r\) in random graphs
- The rainbow connection number of 2-connected graphs
- Further hardness results on the rainbow vertex-connection number of graphs
- Rainbow connections of graphs
- Properly colored paths and cycles
- Rainbow connection number and radius
- Rainbow connection in graphs with minimum degree three
- The 3-rainbow index of a graph
- Some remarks on rainbow connectivity
- Upper bounds for the total rainbow connection of graphs
- Rainbow connection and minimum degree
- The \(k\)-proper index of graphs
- Tight upper bound of the rainbow vertex-connection number for 2-connected graphs
- Graphs with 4-rainbow index 3 and \(n-1\)
- Note on the hardness of rainbow connections for planar and line graphs
- Rainbow connection of random regular graphs
- The hitting time of rainbow connection number two
- Note on the vertex-rainbow index of a graph
- Proper connection of graphs
- Rainbow connection in oriented graphs
- Rainbow \(k\)-connection in dense graphs (extended abstract)
- Rainbow connection number and connected dominating sets
- Rainbow connection number and independence number of a graph
- Rainbow colouring of split graphs
- On forbidden subgraphs and rainbow connection in graphs with minimum degree 2
- On rainbow-\(k\)-connectivity of random graphs
- Rainbow connection number of graph power and graph products
- Rainbow connection number and the number of blocks
- Rainbow connection in graphs
- Rainbow connection and forbidden subgraphs
- On total rainbow \(k\)-connected graphs
- Upper bounds for the rainbow connection numbers of line graphs
- Loose edge-connection of graphs
- Rainbow connection and graph products
- A sharp threshold for rainbow connection of random bipartite graphs
- A sharp threshold for rainbow connection in small-world networks
- Rainbow connectivity using a rank genetic algorithm: Moore cages with girth six
- Multicolorful connectivity of trees
- Rainbow partitions and rainbow polynomial
- IPRainbow
- The vertex-rainbow index of a graph
- Further results on the rainbow vertex-disconnection of graphs
- Rainbow \(k\)-connectivity of random bipartite graphs
- Proper connection number of random graphs
- Some results on the 3-total-rainbow index
- Upper bounding rainbow connection number by forest number
- More on the minimum size of graphs with given rainbow index
- Generalized rainbow connectivity of graphs
- Fine-Grained Complexity of Rainbow Coloring and its Variants.
- Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2
- Rainbow connectivity and rainbow index of inhomogeneous random graphs
- The Bellaterra connection
- Note on the rainbow connection number of dense graphs
- Rainbow connection for some families of hypergraphs
- The vertex-rainbow connection number of some graph operations
- Graphs with 3-rainbow index \(n-1\) and \(n-2\)
- Conflict-free connection number of random graphs
- The rainbow connection problem: mathematical formulations.
- A note on the rainbow connection of random regular graphs
- The strong 3-rainbow index of edge-comb product of a path and a connected graph
- The complexity of determining the vertex-rainbow index of graphs
- Concentration of rainbow \(k\)-connectivity of a multiplex random graph
- Rainbow connection of sparse random graphs
- Proper connection of direct products
- On strong proper connection number of cubic graphs
- Strong rainbow connection in digraphs
- More on the colorful monochromatic connectivity
- On various (strong) rainbow connection numbers of graphs
- Rainbow and monochromatic vertex-connection of random graphs
- The strong 3-rainbow index of some certain graphs and its amalgamation
- On the fine-grained complexity of rainbow coloring
- Strong rainbow coloring of unicyclic graphs
- The (vertex-)monochromatic index of a graph
- Fine-grained complexity of rainbow coloring and its variants
This page was built for publication: On rainbow connection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010776)
