Pages that link to "Item:Q400500"

The following pages link to Tight upper bound of the rainbow vertex-connection number for 2-connected graphs (Q400500):

Displaying 9 items.

• Rainbow vertex-connection and forbidden subgraphs (Q1692637) (← links)
• Rainbow vertex connection of digraphs (Q1698060) (← links)
• Note on the vertex-rainbow index of a graph (Q2048994) (← links)
• The vertex-rainbow connection number of some graph operations (Q2227111) (← links)
• Conflict-free vertex connection number at most 3 and size of graphs (Q2227116) (← links)
• Generalized rainbow connection of graphs (Q2239021) (← links)
• Conflict-free vertex-connections of graphs (Q2282464) (← links)
• Proper rainbow connection number of graphs (Q2656335) (← links)
• A survey on rainbow (vertex-)index of graphs (Q6130217) (← links)