Graphs with large generalized (edge-)connectivity
From MaRDI portal
Publication:339485
DOI10.7151/dmgt.1907zbMath1350.05080arXiv1305.1089MaRDI QIDQ339485
Publication date: 11 November 2016
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.1089
packing; Steiner tree; edge connectivity; generalized edge-connectivity; edge-disjoint trees; internally disjoint trees
05C05: Trees
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C75: Structural characterization of families of graphs
05C40: Connectivity
Related Items
Constructing edge-disjoint Steiner paths in lexicographic product networks, Structure and substructure connectivity of balanced hypercubes, Path 3-(edge-)connectivity of lexicographic product graphs, The minimum size of a graph with given tree connectivity, Structure and substructure connectivity of alternating group graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On extremal graphs with internally disjoint Steiner trees
- Packing of Steiner trees and \(S\)-connectors in graphs
- On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
- Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\)
- Pendant tree-connectivity
- Path-connectivity in graphs
- On the \(\ell\)-connectivity of a graph
- Über die Maximalzahl kantendisjunkter A-Wege
- Über die Maximalzahl kreuzungsfreier H-Wege
- The Steiner tree packing problem in VLSI design
- Edge-disjoint trees containing some given vertices in a graph
- Packing Steiner trees: A cutting plane algorithm and computational results
- Note on the hardness of generalized connectivity
- Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
- The generalized connectivity of complete equipartition 3-partite 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
- 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
- A Generalization of Line Connectivity and Optimally Invulnerable Graphs
- Separation of graphs into three components by the removal of edges
- Graphs with large generalized 3-connectivity
- The generalized 3-connectivity of Lexicographic product graphs
- The generalized 3-connectivity of Cartesian product graphs