Graphs with 4-rainbow index 3 and \(n-1\)

DOI10.7151/dmgt.1794zbMath1311.05032arXiv1312.3069OpenAlexW2592644131MaRDI QIDQ2344025

Yan Zhao, Kang Yang, Ingo Schiermeyer, Xue Liang Li

Publication date: 11 May 2015

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

\(k\)-rainbow indexrainbow \(S\)-tree

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

The 3-rainbow index and connected dominating sets ⋮ Some results on the 3-total-rainbow index ⋮ More on the colorful monochromatic connectivity ⋮ The \(k\)-proper index of graphs ⋮ The vertex-rainbow index of a graph

Cites Work

• On rainbow connection
• A variant of the classical Ramsey problem
• Rainbow connections of graphs: a survey
• The 3-rainbow index of a graph
• Graphs with 3-rainbow index \(n-1\) and \(n-2\)
• Solutions to conjectures on the (k ,ℓ)-rainbow index of complete graphs
• The rainbow connectivity of a graph
• Rainbow trees in graphs and generalized connectivity
• Rainbow connection in graphs

This page was built for publication: Graphs with 4-rainbow index 3 and \(n-1\)