Some upper bounds for 3-rainbow index of graphs

zbMath1351.05082arXiv1310.2355MaRDI QIDQ2829348

Yumei Hu, Tingting Liu

Publication date: 27 October 2016

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

zbMATH Keywords

edge-coloringconnectivityconnected dominating set3-rainbow index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (4)

The 3-rainbow index and connected dominating sets ⋮ Note on the upper bound of the rainbow index of a graph ⋮ A survey on rainbow (vertex-)index of graphs ⋮ The \(k\)-proper index of graphs

This page was built for publication: Some upper bounds for 3-rainbow index of graphs