More on the minimum size of graphs with given rainbow index

DOI10.7151/dmgt.2131zbMath1430.05045OpenAlexW2863147389WikidataQ129552176 ScholiaQ129552176MaRDI QIDQ2282475

Yan Zhao

Publication date: 8 January 2020

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

Full work available at URL: https://doi.org/10.7151/dmgt.2131

zbMATH Keywords

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Connectivity (05C40)

Related Items

Some results on the 3-total-rainbow index, A survey on rainbow (vertex-)index of graphs

Cites Work

• A note on the minimum size of \(k\)-rainbow-connected graphs
• Note on minimally \(d\)-rainbow connected graphs
• On rainbow connection
• Rainbow connections of graphs: a survey
• On minimally rainbow \(k\)-connected graphs
• The 3-rainbow index of a graph
• The rainbow connectivity of a graph
• Rainbow trees in graphs and generalized connectivity
• Rainbow connection in graphs
• The minimum size of graphs with given rainbow index
• Unnamed Item