Characterize graphs with rainbow connection number $m-2$ and $m-3$

zbMath1305.05113arXiv1312.3068MaRDI QIDQ2938261

Yuefang Sun, Yan Zhao, Xue Liang Li

Publication date: 14 January 2015

Full work available at URL: https://arxiv.org/abs/1312.3068

zbMATH Keywords

rainbow connection numberrainbow connected graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (3)

Characterizations of graphs having large proper connection numbers ⋮ More on the colorful monochromatic connectivity ⋮ The complexity of determining the vertex-rainbow index of graphs

This page was built for publication: Characterize graphs with rainbow connection number $m-2$ and $m-3$