Steiner tree packing number and tree connectivity

DOI10.1016/j.disc.2018.03.021zbMath1387.05206OpenAlexW2804991630MaRDI QIDQ1752665

Yingbin Ma, Baoyindureng Wu, Hengzhe Li, Ji Xiang Meng

Publication date: 24 May 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.03.021

zbMATH Keywords

connectivityline graphedge-connectivitytree connectivitypacking Steiner trees

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (11)

The \(\kappa_k\)-connectivity of line graphs ⋮ Edge-disjoint Steiner trees and connectors in graphs ⋮ The generalized 4-connectivity of hierarchical cubic networks ⋮ Two kinds of generalized connectivity of dual cubes ⋮ \(k\)-tree connectivity of line graphs ⋮ The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants ⋮ The generalized 4-connectivity of exchanged hypercubes ⋮ The generalized 3-connectivity of the Mycielskian of a graph ⋮ On tree-connectivity and path-connectivity of graphs ⋮ Generalized 4-connectivity of hierarchical star networks ⋮ Internally disjoint trees in the line graph and total graph of the complete bipartite graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Packing Steiner trees
• Packing Steiner trees on four terminals
• 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
• Edge-disjoint trees containing some given vertices in a graph
• On decomposing a hypergraph into \(k\) connected sub-hypergraphs
• The connectivity of line-graphs
• 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

This page was built for publication: Steiner tree packing number and tree connectivity