On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
From MaRDI portal
Publication:897279
DOI10.1007/s00373-014-1500-7zbMath1328.05046arXiv1304.3774MaRDI QIDQ897279
Publication date: 17 December 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.3774
packing; Steiner tree; (edge-)connectivity; generalized local (edge-)connectivity; internally (edge-)disjoint trees
05C05: Trees
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C40: Connectivity
Related Items
On extremal graphs with exactly one Steiner tree connecting any $k$ vertices, Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks, The \((k,\ell)\)-rainbow index of random graphs, 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, On two generalized connectivities of graphs, A result on the 3-generalized connectivity of a graph and its line graph, Constructing edge-disjoint Steiner paths in lexicographic product networks, Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs, On the maximum and minimum sizes of a graph with given \(k\)-connectivity
Cites Work
- On extremal graphs with internally disjoint Steiner trees
- On k-rails in graphs
- Packing of Steiner trees and \(S\)-connectors in graphs
- An approximate max-Steiner-tree-packing min-Steiner-cut theorem
- Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\)
- Pendant tree-connectivity
- On the \(\ell\)-connectivity of a graph
- Über die Maximalzahl kantendisjunkter A-Wege
- Über die Maximalzahl kreuzungsfreier H-Wege
- Edge-disjoint trees containing some given vertices in a graph
- The average connectivity of a graph
- Connectivity and edge-disjoint spanning trees
- Note on the hardness of generalized connectivity
- The generalized connectivity of complete equipartition 3-partite graphs
- On graphs with at most four line-disjoint paths connecting any two vertices
- Ein Extremalproblem des Zusammenhangs von Graphen
- Grad und lokaler Zusammenhang in endlichen Graphen
- On a conjecture of Bollobas and Erdős
- On the generalized (edge-)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
- Edge disjoint Steiner trees in graphs without large bridges
- Cycles and semi-topological configurations
- Graphs with large generalized 3-connectivity
- The generalized 3-connectivity of Lexicographic product graphs
- The generalized 3-connectivity of Cartesian product graphs
- Graphs with 6-Ways
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
