A note on the minimum size of \(k\)-rainbow-connected graphs
From MaRDI portal
Publication:397136
DOI10.1016/j.disc.2014.04.024zbMath1297.05086arXiv1506.03215OpenAlexW2003289864MaRDI QIDQ397136
Publication date: 8 August 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.03215
Related Items (6)
Rainbow connection number and graph operations ⋮ Upper bounds of proper connection number of graphs ⋮ The vertex-rainbow connection number of some graph operations ⋮ Erdős-Gallai-type results for colorful monochromatic connectivity of a graph ⋮ Some extremal results on the colorful monochromatic vertex-connectivity of a graph ⋮ More on the minimum size of graphs with given rainbow index
Cites Work
This page was built for publication: A note on the minimum size of \(k\)-rainbow-connected graphs