Pages that link to "Item:Q397136"
From MaRDI portal
The following pages link to A note on the minimum size of \(k\)-rainbow-connected graphs (Q397136):
Displaying 6 items.
- Erdős-Gallai-type results for colorful monochromatic connectivity of a graph (Q512870) (← links)
- Some extremal results on the colorful monochromatic vertex-connectivity of a graph (Q1752632) (← links)
- The vertex-rainbow connection number of some graph operations (Q2227111) (← links)
- More on the minimum size of graphs with given rainbow index (Q2282475) (← links)
- Rainbow connection number and graph operations (Q2399294) (← links)
- Upper bounds of proper connection number of graphs (Q2410035) (← links)