The following pages link to On rainbow connection (Q1010776):
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)
- 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)
- 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)
- 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)
- Tight upper bound of the rainbow vertex-connection number for 2-connected graphs (Q400500) (← links)
- Rainbow connection number and connectivity (Q426778) (← 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)
- Erdős-Gallai-type results for colorful monochromatic connectivity of a graph (Q512870) (← links)
- The complexity of determining the rainbow vertex-connection of a graph (Q638512) (← links)
- Properly colored paths and cycles (Q642961) (← links)
- The vertex-rainbow index of a graph (Q726646) (← links)
- Rainbow connection number and radius (Q742568) (← links)
- Note on minimally \(d\)-rainbow connected graphs (Q742605) (← links)
- Generalized rainbow connectivity of graphs (Q744052) (← links)
- Proper connection number of random graphs (Q897901) (← links)
- Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 (Q898171) (← links)
- Rainbow paths (Q965956) (← links)
- The Bellaterra connection (Q1325633) (← links)
- More on the colorful monochromatic connectivity (Q1684281) (← links)
- Rainbow vertex connection of digraphs (Q1698060) (← links)
- Strong rainbow connection in digraphs (Q1701123) (← links)
- The \(k\)-proper index of graphs (Q1734744) (← links)
- On total rainbow \(k\)-connected graphs (Q1739988) (← links)
- Rainbow connections in digraphs (Q1752466) (← links)
- Upper bounds for the rainbow connection numbers of line graphs (Q1926059) (← links)
- Rainbow connections of graphs: a survey (Q1938889) (← links)
- Rainbow connection of sparse random graphs (Q1953307) (← links)
- The hitting time of rainbow connection number two (Q1953346) (← links)
- The (vertex-)monochromatic index of a graph (Q2012896) (← links)
- Rainbow connection and graph products (Q2014711) (← links)
- Rainbow \(k\)-connectivity of random bipartite graphs (Q2025233) (← links)
- Note on the vertex-rainbow index of a graph (Q2048994) (← links)
