On Maximal Independent Arborescence Packing

DOI10.1137/130938396zbMath1350.05138OpenAlexW2548665519MaRDI QIDQ2832576

Csaba Király

Publication date: 11 November 2016

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

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

zbMATH Keywords

packingmatroidarborescence

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Related Items (8)

Reachability in arborescence packings ⋮ Packing of arborescences with matroid constraints via matroid intersection ⋮ Packing of spanning mixed arborescences ⋮ The \(b\)-branching problem in digraphs ⋮ Unnamed Item ⋮ Packing of maximal independent mixed arborescences ⋮ Packing branchings under cardinality constraints on their root sets ⋮ Old and new results on packing arborescences in directed hypergraphs

Cites Work

• A note on disjoint arborescences
• A rooted-forest partition with uniform vertex demand
• Arc-disjoint in-trees in directed graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• On the Infinitesimal Rigidity of Bar-and-Slider Frameworks
• Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries
• Matroid-Based Packing of Arborescences
• Decomposition of Finite Graphs Into Forests
• Unnamed Item
• Unnamed Item

This page was built for publication: On Maximal Independent Arborescence Packing