Pages that link to "Item:Q742605"
From MaRDI portal
The following pages link to Note on minimally \(d\)-rainbow connected graphs (Q742605):
Displaying 11 items.
- A note on the minimum size of \(k\)-rainbow-connected graphs (Q397136) (← links)
- Erdős-Gallai-type results for colorful monochromatic connectivity of a graph (Q512870) (← links)
- The vertex-rainbow index of a graph (Q726646) (← links)
- Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number (Q1656916) (← links)
- On total rainbow \(k\)-connected graphs (Q1739988) (← 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)
- The complexity of determining the vertex-rainbow index of graphs (Q2788724) (← links)