Pages that link to "Item:Q2911628"
From MaRDI portal
The following pages link to Rainbow connectivity: hardness and tractability (Q2911628):
Displaying 23 items.
- Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs (Q300179) (← links)
- Rainbow colouring of split graphs (Q344835) (← links)
- On the rainbow connectivity of graphs: complexity and FPT algorithms (Q378215) (← links)
- Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs (Q427574) (← links)
- Hardness and algorithms for rainbow connection (Q491198) (← links)
- Generalized rainbow connectivity of graphs (Q744052) (← links)
- Further hardness results on rainbow and strong rainbow connectivity (Q908308) (← links)
- On the complexity of rainbow coloring problems (Q1647834) (← links)
- Strong rainbow connection in digraphs (Q1701123) (← links)
- Rainbow connections in digraphs (Q1752466) (← links)
- Fine-grained complexity of rainbow coloring and its variants (Q2051859) (← links)
- Hardness results for three kinds of colored connections of graphs (Q2202016) (← links)
- Generalized rainbow connection of graphs (Q2239021) (← links)
- Algorithms and bounds for very strong rainbow coloring (Q2294720) (← links)
- Note on the hardness of rainbow connections for planar and line graphs (Q2350709) (← links)
- Rainbow connection number and graph operations (Q2399294) (← links)
- On the Fine-Grained Complexity of Rainbow Coloring (Q3174728) (← links)
- Strong rainbow connection numbers of toroidal meshes (Q4554570) (← links)
- Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs (Q5005187) (← links)
- Fine-Grained Complexity of Rainbow Coloring and its Variants. (Q5111276) (← links)
- Hardness and Algorithms for Rainbow Connectivity (Q5389981) (← links)
- A survey on rainbow (vertex-)index of graphs (Q6130217) (← links)
- Counting on rainbow \(k\)-connections (Q6636091) (← links)
