The 3-rainbow index of a graph
From MaRDI portal
Publication:2259571
DOI10.7151/dmgt.1780zbMath1307.05066arXiv1307.0079OpenAlexW2963121469MaRDI QIDQ2259571
Yan Zhao, Lily Chen, Kang Yang, Xue Liang Li
Publication date: 4 March 2015
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.0079
Trees (05C05) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items
The 3-rainbow index and connected dominating sets ⋮ Note on the upper bound of the rainbow index of a graph ⋮ Some results on the 3-total-rainbow index ⋮ The strong 3-rainbow index of edge-comb product of a path and a connected graph ⋮ The strong 3-rainbow index of some certain graphs and its amalgamation ⋮ 3-rainbow index and forbidden subgraphs ⋮ More on the colorful monochromatic connectivity ⋮ A survey on rainbow (vertex-)index of graphs ⋮ Some upper bounds for the 3-proper index of graphs ⋮ The \(k\)-proper index of graphs ⋮ Generalized rainbow connection of graphs ⋮ Graphs with 3-rainbow index \(n-1\) and \(n-2\) ⋮ Some results on the 3-vertex-rainbow index of a graph ⋮ The \((k,\ell )\)-proper index of graphs ⋮ More on the minimum size of graphs with given rainbow index ⋮ The vertex-rainbow index of a graph ⋮ The strong 3-rainbow index of edge-amalgamation of some graphs ⋮ Graphs with 4-rainbow index 3 and \(n-1\)
Cites Work
