Pages that link to "Item:Q397136"

The following pages link to A note on the minimum size of \(k\)-rainbow-connected graphs (Q397136):

Displaying 10 items.

• The minimum size of \(k\)-rainbow connected graphs of given order (Q383755) (← links)
• Erdős-Gallai-type results for colorful monochromatic connectivity of a graph (Q512870) (← links)
• Note on minimally \(d\)-rainbow connected graphs (Q742605) (← links)
• Some extremal results on the colorful monochromatic vertex-connectivity of a graph (Q1752632) (← links)
• On minimally rainbow \(k\)-connected graphs (Q1941399) (← 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)
• Smallest \(k\)-rainbow connected graphs for large \(k\) (Q2869375) (← links)