Edge-disjoint trees containing some given vertices in a graph

DOI10.1016/S0095-8956(02)00013-8zbMath1027.05023MaRDI QIDQ1405100

Matthias Kriesell

Publication date: 25 August 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

spanning treeedge-connected

Mathematics Subject Classification ID

Trees (05C05)

Related Items (23)

Packing Steiner trees ⋮ Hardness and approximation results for packing Steiner trees ⋮ Packing Steiner trees with identical terminal sets ⋮ Graphs with large generalized (edge-)connectivity ⋮ Packing Steiner trees on four terminals ⋮ Steiner connectivity problems in hypergraphs ⋮ Directed Steiner tree packing and directed tree connectivity ⋮ Hamilton cycles in 5-connected line graphs ⋮ On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices ⋮ Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees ⋮ Packing strong subgraph in digraphs ⋮ The \(\kappa_k\)-connectivity of line graphs ⋮ Unnamed Item ⋮ Edge-disjoint Steiner trees and connectors in graphs ⋮ Spanning trees: A survey ⋮ Completely independent spanning trees in some regular graphs ⋮ Steiner tree packing number and tree connectivity ⋮ Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs ⋮ Packing the Steiner trees of a graph ⋮ Generalized connectivity of some total graphs ⋮ Packing of Steiner trees and \(S\)-connectors in graphs ⋮ Edge disjoint Steiner trees in graphs without large bridges ⋮ Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs

Cites Work

• Paths and edge-connectivity in graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Eine Reduktionsmethode für den Kantenzusammenhang in Graphen
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Edge-disjoint trees containing some given vertices in a graph