Pages that link to "Item:Q5190328"
From MaRDI portal
The following pages link to The rainbow connection of a graph is (at most) reciprocal to its minimum degree (Q5190328):
Displaying 50 items.
- The \((k,\ell)\)-rainbow index of random graphs (Q263013) (← links)
- On finding rainbow and colorful paths (Q266284) (← 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)
- The rainbow vertex-index of complementary graphs (Q307925) (← links)
- Total rainbow connection number and complementary graph (Q310863) (← 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 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)
- Total rainbow \(k\)-connection in graphs (Q400527) (← links)
- Rainbow connection of graphs with diameter 2 (Q408184) (← 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)
- 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)
- Complexity of rainbow vertex connectivity problems for restricted graph classes (Q505435) (← 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)
- The vertex-rainbow index of a graph (Q726646) (← links)
- Rainbow connection number and radius (Q742568) (← links)
- Generalized rainbow connectivity of graphs (Q744052) (← links)
- Algorithms for the rainbow vertex coloring problem on graph classes (Q820548) (← links)
- The rainbow vertex-disconnection in graphs (Q831025) (← 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)
- On the complexity of rainbow coloring problems (Q1647834) (← links)
- Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number (Q1656916) (← links)
- Rainbow vertex-connection and forbidden subgraphs (Q1692637) (← links)
- Total rainbow connection of digraphs (Q1693154) (← links)
- On (strong) proper vertex-connection of graphs (Q1695612) (← links)
- Rainbow vertex connection of digraphs (Q1698060) (← links)
- Strong rainbow connection in digraphs (Q1701123) (← links)
- Generalized rainbow connection of graphs and their complements (Q1708384) (← links)
- The \(k\)-proper index of graphs (Q1734744) (← links)
- Hardness result for the total rainbow \(k\)-connection of graphs (Q1735420) (← links)
- Rainbow connection numbers of Cayley digraphs on abelian groups (Q1739982) (← links)
- On total rainbow \(k\)-connected graphs (Q1739988) (← links)
