Subgraphs decomposable into two trees and \(k\)-edge-connected subgraphs

DOI10.1016/S0166-218X(02)00194-4zbMath1009.05071MaRDI QIDQ1861573

Refael Hassin, Asaf Levin

Publication date: 9 March 2003

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

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Cites Work

• Connectivity and edge-disjoint spanning trees
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• Unnamed Item