The minimal size of a graph with given generalized 3-edge-connectivity
From MaRDI portal
Publication:2804745
zbMath1349.05093arXiv1201.3699MaRDI QIDQ2804745
Publication date: 4 May 2016
Full work available at URL: https://arxiv.org/abs/1201.3699
05C05: Trees
05C35: Extremal problems in graph theory
05C75: Structural characterization of families of graphs
05C12: Distance in graphs
05C40: Connectivity
Related Items
Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks, Graphs with large generalized (edge-)connectivity, A solution to a conjecture on the generalized connectivity of graphs, The generalized connectivity of the line graph and the total graph for the complete bipartite graph, The \(\kappa_k\)-connectivity of line graphs, The minimum size of a graph with given tree connectivity, Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs