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

DOI10.7151/dmgt.1783zbMath1307.05051arXiv1308.4251OpenAlexW2081078825MaRDI QIDQ2259573

Kang Yang, Yan Zhao, Ingo Schiermeyer, 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/1308.4251

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 (6)

More on the colorful monochromatic connectivity ⋮ Some upper bounds for the 3-proper index of graphs ⋮ The \(k\)-proper index of graphs ⋮ Some results on the 3-vertex-rainbow index of a graph ⋮ The vertex-rainbow index of a graph ⋮ Graphs with 4-rainbow index 3 and \(n-1\)

Cites Work

• On rainbow connection
• Rainbow connections of graphs: a survey
• The 3-rainbow index of a graph
• 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 3-rainbow index \(n-1\) and \(n-2\)