The minimum size of a graph with given tree connectivity
From MaRDI portal
Publication:2227103
DOI10.7151/dmgt.2193zbMath1459.05045OpenAlexW2906518124WikidataQ128716230 ScholiaQ128716230MaRDI QIDQ2227103
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
packinggeneralized connectivitytree connectivitygeneralized \(k\)-connectivitygeneralized \(k\)-edge-connectivity
Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sharp upper bounds for generalized edge-connectivity of product graphs
- Graphs with large generalized (edge-)connectivity
- Tree connectivities of Cayley graphs on abelian groups with small degrees
- A solution to a conjecture on the generalized connectivity of graphs
- On the difference of two generalized connectivities of a graph
- Spanning trees: A survey
- Pendant tree-connectivity
- The Steiner tree packing problem in VLSI design
- Steiner minimal trees
- Packing Steiner trees: A cutting plane algorithm and computational results
- Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
- A sharp lower bound for the generalized 3-edge-connectivity of strong product 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
- Generalized Connectivity of Graphs
- 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
- Graphs with large generalized 3-connectivity
- The generalized 3-connectivity of Lexicographic product graphs
- Generalized 3-edge-connectivity of Cartesian product graphs
- The generalized 3-connectivity of Cartesian product graphs
- On the spanning tree packing number of a graph: A survey
This page was built for publication: The minimum size of a graph with given tree connectivity
