Pages that link to "Item:Q2828968"
From MaRDI portal
The following pages link to Rainbow vertex connection number of dense and sparse graphs. (Q2828968):
Displaying 8 items.
- Tight upper bound of the rainbow vertex-connection number for 2-connected graphs (Q400500) (← links)
- Graphs with vertex rainbow connection number two (Q498122) (← links)
- Rainbow vertex-connection and forbidden subgraphs (Q1692637) (← links)
- Further results on the rainbow vertex-disconnection of graphs (Q2049030) (← links)
- The vertex-rainbow connection number of some graph operations (Q2227111) (← links)
- Rainbow connection number of dense graphs (Q2857035) (← links)
- Nordhaus-Gaddum-type bounds for the rainbow vertex-connection number of a graph (Q2895393) (← links)
- (Q3134374) (← links)