The following pages link to Rainbow connection in graphs (Q3392716):
Displaying 50 items.
- The \((k,\ell)\)-rainbow index of random graphs (Q263013) (← links)
- The 3-rainbow index and connected dominating sets (Q266041) (← links)
- Hardness results for total rainbow connection of graphs (Q274688) (← links)
- Characterizations of graphs having large proper connection numbers (Q274703) (← links)
- Rainbow connections for outerplanar graphs with diameter 2 and 3 (Q279540) (← links)
- Finite families of forbidden subgraphs for rainbow connection in graphs (Q297932) (← links)
- Note on the upper bound of the rainbow index of a graph (Q298957) (← links)
- Sufficient conditions for 2-rainbow connected graphs (Q298982) (← links)
- Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs (Q300179) (← links)
- The rainbow vertex-index of complementary graphs (Q307925) (← links)
- The \((k,\ell)\)-rainbow index for complete bipartite and multipartite graphs (Q310735) (← links)
- Total rainbow connection number and complementary graph (Q310863) (← links)
- Rainbow connection number of amalgamation of some graphs (Q322063) (← links)
- Some remarks on rainbow connectivity (Q322204) (← links)
- Upper bounds for the total rainbow connection of graphs (Q328717) (← links)
- Rainbow connection number and independence number of a graph (Q343733) (← links)
- Rainbow colouring of split graphs (Q344835) (← links)
- Rainbow connection in 3-connected graphs (Q367069) (← links)
- Nordhaus-Gaddum-type theorem for rainbow connection number of graphs (Q367076) (← links)
- On the rainbow connectivity of graphs: complexity and FPT algorithms (Q378215) (← links)
- The rainbow connection number of 2-connected graphs (Q383747) (← links)
- Further hardness results on the rainbow vertex-connection number of graphs (Q385046) (← links)
- A note on the minimum size of \(k\)-rainbow-connected graphs (Q397136) (← links)
- Tight upper bound of the rainbow vertex-connection number for 2-connected graphs (Q400500) (← links)
- Total rainbow \(k\)-connection in graphs (Q400527) (← links)
- Rainbow connection of graphs with diameter 2 (Q408184) (← links)
- Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs (Q427574) (← links)
- On rainbow-\(k\)-connectivity of random graphs (Q436344) (← links)
- Proper connection of graphs (Q442366) (← links)
- Rainbow connection in oriented graphs (Q477332) (← links)
- On forbidden subgraphs and rainbow connection in graphs with minimum degree 2 (Q482191) (← links)
- Rainbow connection number of graph power and graph products (Q489302) (← links)
- Rainbow connection number and the number of blocks (Q489352) (← links)
- Hardness and algorithms for rainbow connection (Q491198) (← links)
- On rainbow total-coloring of a graph (Q494442) (← links)
- Graphs with vertex rainbow connection number two (Q498122) (← links)
- Rainbow connection in some digraphs (Q503612) (← links)
- Rainbow connection number of graphs with diameter 3 (Q503673) (← links)
- Complexity of rainbow vertex connectivity problems for restricted graph classes (Q505435) (← links)
- Monochromatic connecting colorings in strongly connected oriented graphs (Q507473) (← links)
- Erdős-Gallai-type results for colorful monochromatic connectivity of a graph (Q512870) (← links)
- Algorithm on rainbow connection for maximal outerplanar graphs (Q517025) (← links)
- Rainbow connectivity of cacti and of some infinite digraphs (Q521748) (← links)
- The complexity of determining the rainbow vertex-connection of a graph (Q638512) (← links)
- Properly colored paths and cycles (Q642961) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs (Q681264) (← links)
- Proper connection numbers of complementary graphs (Q723592) (← links)
- The vertex-rainbow index of a graph (Q726646) (← links)
- Rainbow connection number and radius (Q742568) (← links)
