Pages that link to "Item:Q505435"
From MaRDI portal
The following pages link to Complexity of rainbow vertex connectivity problems for restricted graph classes (Q505435):
Displaying 7 items.
- Further hardness results on the rainbow vertex-connection number of graphs (Q385046) (← links)
- The complexity of determining the rainbow vertex-connection of a graph (Q638512) (← links)
- Algorithms for the rainbow vertex coloring problem on graph classes (Q820548) (← links)
- Further hardness results on rainbow and strong rainbow connectivity (Q908308) (← links)
- Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs (Q5005187) (← links)
- Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes (Q5089235) (← links)
- Hardness and Algorithms for Rainbow Connectivity (Q5389981) (← links)