Pages that link to "Item:Q5389981"
From MaRDI portal
The following pages link to Hardness and Algorithms for Rainbow Connectivity (Q5389981):
Displaying 23 items.
- Rainbow connections for outerplanar graphs with diameter 2 and 3 (Q279540) (← 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)
- 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)
- On rainbow total-coloring of a graph (Q494442) (← links)
- The complexity of determining the rainbow vertex-connection of a graph (Q638512) (← links)
- Rainbow connection number and radius (Q742568) (← links)
- Rainbow vertex connection of digraphs (Q1698060) (← links)
- The \(k\)-proper index of graphs (Q1734744) (← links)
- Rainbow connections of graphs: a survey (Q1938889) (← links)
- Multicolorful connectivity of trees (Q2242784) (← links)
- Colorful monochromatic connectivity (Q2275401) (← links)
- Rainbow connectivity using a rank genetic algorithm: Moore cages with girth six (Q2337023) (← links)
- Note on the hardness of rainbow connections for planar and line graphs (Q2350709) (← links)
- Upper bound involving parameter \(\sigma_2\) for the rainbow connection number (Q2439242) (← links)
- The complexity of determining the vertex-rainbow index of graphs (Q2788724) (← links)
- Rainbow connection number and connected dominating sets (Q2911064) (← links)
- Rainbow and strong rainbow connection number for some families of graphs (Q5145917) (← links)
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree (Q5190328) (← links)
- On various (strong) rainbow connection numbers of graphs (Q5374232) (← links)
- Rainbow vertex-connection and graph products (Q5739599) (← links)
- Rainbow connectivity and rainbow index of inhomogeneous random graphs (Q6081106) (← links)