The minimum size of a graph with given tree connectivity
DOI10.7151/DMGT.2193zbMATH Open1459.05045OpenAlexW2906518124WikidataQ128716230 ScholiaQ128716230MaRDI QIDQ2227103FDOQ2227103
Authors: Yanyan Li 
Publication date: 10 February 2021
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2193
Recommendations
- The minimal size of a graph with generalized connectivity \(\kappa_3=2\)
- Note on the generalized connectivity.
- The minimal size of a graph with given generalized 3-edge-connectivity.
- On the maximum and minimum sizes of a graph with given \(k\)-connectivity
- On minimally 2-connected graphs with generalized connectivity \(\kappa_3=2\)
packinggeneralized connectivitytree connectivitygeneralized \(k\)-connectivitygeneralized \(k\)-edge-connectivity
Trees (05C05) Extremal problems in graph theory (05C35) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory
- Rainbow trees in graphs and generalized connectivity
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- A solution to a conjecture on the generalized connectivity of graphs
- Spanning trees: A survey
- Steiner tree problems in computer communication networks.
- Title not available (Why is that?)
- Pendant tree-connectivity
- The Steiner tree packing problem in VLSI design
- Packing Steiner trees: A cutting plane algorithm and computational results
- Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
- Note on the spanning-tree packing number of lexicographic product graphs
- The minimal size of a graph with given generalized 3-edge-connectivity.
- On the generalized (edge-)connectivity of graphs
- Sharp upper bounds for generalized edge-connectivity of product graphs
- Graphs with large generalized (edge-)connectivity
- Note on the generalized connectivity.
- Tree connectivities of Cayley graphs on abelian groups with small degrees
- On the difference of two generalized connectivities of a graph
- The generalized 3-connectivity of lexicographic product graphs
- Generalized 3-edge-connectivity of Cartesian product graphs.
- The generalized 3-connectivity of Cartesian product
- Generalized Connectivity of Graphs
- Steiner minimal trees
- On the spanning tree packing number of a graph: A survey
- A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs
Cited In (13)
- On the minimum size of graphs with given generalized connectivity
- Title not available (Why is that?)
- On extremal graphs with internally disjoint Steiner trees
- The minimal size of a graph with given generalized 3-edge-connectivity.
- The minimal size of a graph with generalized connectivity \(\kappa_3=2\)
- On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
- Minimum degree and minimum number of edge-disjoint trees
- On extremal graphs with exactly one Steiner tree connecting any \(k\) vertices
- \(k\)-tree connectivity of line graphs
- Two-tree graphs with minimum sum-connectivity index
- The tree connectivity of regular complete bipartite graphs
- Note on the generalized connectivity.
- On the maximum and minimum sizes of a graph with given \(k\)-connectivity
This page was built for publication: The minimum size of a graph with given tree connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2227103)
