Pages that link to "Item:Q328717"
From MaRDI portal
The following pages link to Upper bounds for the total rainbow connection of graphs (Q328717):
Displaying 6 items.
- A sharp upper bound for the rainbow 2-connection number of a 2-connected graph (Q1942665) (← links)
- On the total proper connection of graphs (Q2272614) (← links)
- Total rainbow connection numbers of some special graphs (Q2279465) (← links)
- Erdős-Gallai-type results for total monochromatic connection of graphs (Q2312052) (← links)
- (Q2987164) (← links)
- On various (strong) rainbow connection numbers of graphs (Q5374232) (← links)
