On minimally rainbow \(k\)-connected graphs
From MaRDI portal
Publication:1941399
DOI10.1016/j.dam.2011.05.001zbMath1259.05102OpenAlexW1997212866MaRDI QIDQ1941399
Publication date: 12 March 2013
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.05.001
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Related Items
Rainbow connections for outerplanar graphs with diameter 2 and 3, Some results on the total proper \(k\)-connection number, Some results on the 3-total-rainbow index, Rainbow connection number and graph operations, Upper bounds of proper connection number of graphs, The minimum size of \(k\)-rainbow connected graphs of given order, A note on the minimum size of \(k\)-rainbow-connected graphs, Tight upper bound of the rainbow vertex-connection number for 2-connected graphs, Strong rainbow connection in digraphs, Proper connection of graphs, Rainbow connection in oriented graphs, The vertex-rainbow connection number of some graph operations, The \(g\)-component connectivity of graphs, Rainbow connection numbers of Cayley digraphs on abelian groups, On total rainbow \(k\)-connected graphs, Erdős-Gallai-type results for colorful monochromatic connectivity of a graph, Some extremal results on the colorful monochromatic vertex-connectivity of a graph, Some results on the 3-vertex-rainbow index of a graph, Total rainbow connection numbers of some special graphs, More on the minimum size of graphs with given rainbow index, The vertex-rainbow index of a graph, On the \(g\)-good-neighbor connectivity of graphs, Rainbow connectivity of Moore cages of girth 6, Note on minimally \(d\)-rainbow connected graphs, Fractional matching preclusion number of graphs, Note on the hardness of rainbow connections for planar and line graphs
