Pages that link to "Item:Q400500"
From MaRDI portal
The following pages link to Tight upper bound of the rainbow vertex-connection number for 2-connected graphs (Q400500):
Displaying 14 items.
- Upper bounds for the total rainbow connection of graphs (Q328717) (← links)
- Rainbow vertex-connection and forbidden subgraphs (Q1692637) (← links)
- Rainbow vertex connection of digraphs (Q1698060) (← links)
- A sharp upper bound for the rainbow 2-connection number of a 2-connected graph (Q1942665) (← 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)
- (Q2987164) (← links)
- On various (strong) rainbow connection numbers of graphs (Q5374232) (← links)
- (1, 2)-rainbow connection number at most 3 in connected dense graphs (Q6090318) (← links)
- A survey on rainbow (vertex-)index of graphs (Q6130217) (← links)
