On packing connectors

DOI10.1006/jctb.1998.1825zbMath0916.05056OpenAlexW2165714486MaRDI QIDQ1272488

Alexander Schrijver, J. C. M. Keijsper

Publication date: 8 March 1999

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

Full work available at URL: https://doi.org/10.1006/jctb.1998.1825

zbMATH Keywords

partitionconnectorpacking bibranches

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (2)

Complexity of packing common bases in matroids ⋮ An algorithm for packing connectors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient algorithm for minimum-weight bibranching
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Min-max Relations for Directed Graphs
• Packing Spanning Trees

This page was built for publication: On packing connectors