An algorithm for packing connectors

DOI10.1006/jctb.1998.1863zbMath1023.05113OpenAlexW1981684106MaRDI QIDQ1569028

N. Delaunay

Publication date: 25 June 2000

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

Full work available at URL: https://semanticscholar.org/paper/1274d238c5cb5caf22bd6e5c7cae5c7d5848820f

zbMATH Keywords

graphic matroidsspanning trees

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (1)

Adjacency, inseparability, and base orderability in matroids

Cites Work

• Forests, frames, and games: Algorithms for matroid sums and applications
• On packing connectors
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Disjoint Common Transversals and Exchange Structures
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for packing connectors