Solutions to conjectures on the (k ,ℓ)-rainbow index of complete graphs

DOI10.1002/net.21513zbMath1339.05211arXiv1212.6845OpenAlexW1991176101WikidataQ122950879 ScholiaQ122950879MaRDI QIDQ2811310

Qingqiong Cai, Jiangli Song, Xue Liang Li

Publication date: 10 June 2016

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

rainbow indexrainbow connectivityrainbow tree

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (10)

The 3-rainbow index and connected dominating sets ⋮ Note on the upper bound of the rainbow index of a graph ⋮ The \((k,\ell)\)-rainbow index for complete bipartite and multipartite graphs ⋮ A survey on rainbow (vertex-)index of graphs ⋮ Generalized rainbow connection of graphs ⋮ The complexity of determining the vertex-rainbow index of graphs ⋮ The \((k,\ell )\)-proper index of graphs ⋮ The vertex-rainbow index of a graph ⋮ Graphs with 4-rainbow index 3 and \(n-1\) ⋮ The \((k,\ell)\)-rainbow index of random graphs

Cites Work

• Rainbow connections of graphs: a survey
• The rainbow connectivity of a graph
• Rainbow trees in graphs and generalized connectivity

This page was built for publication: Solutions to conjectures on the (k ,ℓ)-rainbow index of complete graphs