Pages that link to "Item:Q385046"

The following pages link to Further hardness results on the rainbow vertex-connection number of graphs (Q385046):

Displaying 11 items.

• Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs (Q300179) (← links)
• Upper bounds for the total rainbow connection of graphs (Q328717) (← links)
• Tight upper bound of the rainbow vertex-connection number for 2-connected graphs (Q400500) (← links)
• Complexity of rainbow vertex connectivity problems for restricted graph classes (Q505435) (← links)
• Algorithms for the rainbow vertex coloring problem on graph classes (Q820548) (← links)
• On the complexity of rainbow coloring problems (Q1647834) (← links)
• The vertex-rainbow connection number of some graph operations (Q2227111) (← links)
• The complexity of determining the vertex-rainbow index of graphs (Q2788724) (← links)
• Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs (Q5005187) (← links)
• Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes (Q5089235) (← links)
• A survey on rainbow (vertex-)index of graphs (Q6130217) (← links)