More on the minimum size of graphs with given rainbow index
From MaRDI portal
Publication:2282475
DOI10.7151/dmgt.2131zbMath1430.05045OpenAlexW2863147389WikidataQ129552176 ScholiaQ129552176MaRDI QIDQ2282475
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
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
Cites Work
- Unnamed Item
- 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