Pages that link to "Item:Q1938889"
From MaRDI portal
The following pages link to Rainbow connections of graphs: a survey (Q1938889):
Displayed 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)
- 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)
- Note on vertex and total proper connection numbers (Q334117) (← 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)
- 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)
- 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)
- 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)
- Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks (Q511728) (← links)
- Erdős-Gallai-type results for colorful monochromatic connectivity of a graph (Q512870) (← links)
- Coupon coloring of some special graphs (Q512874) (← links)
- The vertex-rainbow index of a graph (Q726646) (← links)
- Note on minimally \(d\)-rainbow connected graphs (Q742605) (← links)
- Proper connection number and connected dominating sets (Q896128) (← links)
- Proper connection number of random graphs (Q897901) (← links)
- Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 (Q898171) (← links)
- Further hardness results on rainbow and strong rainbow connectivity (Q908308) (← links)
- Rainbow connections of graphs: a survey (Q1938889) (← links)
- Rainbow connection and graph products (Q2014711) (← links)
- The 3-rainbow index of a graph (Q2259571) (← links)
- Graphs with 3-rainbow index \(n-1\) and \(n-2\) (Q2259573) (← links)
- Graphs with 4-rainbow index 3 and \(n-1\) (Q2344025) (← links)
- Rainbow connection and forbidden subgraphs (Q2346333) (← links)
- Note on the hardness of rainbow connections for planar and line graphs (Q2350709) (← links)
- Total monochromatic connection of graphs (Q2374173) (← links)
- Upper bound involving parameter \(\sigma_2\) for the rainbow connection number (Q2439242) (← links)