The 3-rainbow index and connected dominating sets

DOI10.1007/s10878-014-9815-0zbMath1336.05100arXiv1404.2377OpenAlexW2038736197MaRDI QIDQ266041

Qingqiong Cai, Yan Zhao, Xue Liang Li

Publication date: 13 April 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

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

zbMATH Keywords

3-rainbow indexconnected dominating setsrainbow paths

Mathematics Subject Classification ID

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

Related Items (8)

Note on the upper bound of the rainbow index of a graph ⋮ Some results on the 3-total-rainbow index ⋮ 3-rainbow index and forbidden subgraphs ⋮ 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 ⋮ The \((k,\ell )\)-proper index of graphs

Cites Work

• Unnamed Item
• The \((k,\ell)\)-rainbow index of random graphs
• The \((k,\ell)\)-rainbow index for complete bipartite and multipartite graphs
• Hardness and algorithms for rainbow connection
• On rainbow connection
• Spanning trees in graphs of minimum degree 4 or 5
• Rainbow connections of graphs: a survey
• The 3-rainbow index of a graph
• Graphs with 4-rainbow index 3 and \(n-1\)
• Solutions to conjectures on the (k ,ℓ)-rainbow index of complete graphs
• Some upper bounds for 3-rainbow index of graphs
• Rainbow connection number and connected dominating sets
• The rainbow connectivity of a graph
• Rainbow trees in graphs and generalized connectivity
• Spanning Trees with Many Leaves
• Rainbow connection in graphs
• Connected Domination and Spanning Trees with Many Leaves

This page was built for publication: The 3-rainbow index and connected dominating sets