Matroid-reachability-based decomposition into arborescences
From MaRDI portal
Cites work
- Arc-disjoint in-trees in directed graphs
- Connections in combinatorial optimization
- Covering intersecting bi-set families under matroid constraints
- Decomposition of Finite Graphs Into Forests
- Edge-Disjoint Spanning Trees of Finite Graphs
- scientific article; zbMATH DE number 3659627 (Why is no real title available?)
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 3799695 (Why is no real title available?)
- Matroid-Based Packing of Arborescences
- Matroid-rooted packing of arborescences
- Old and new results on packing arborescences in directed hypergraphs
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs
- On maximal independent arborescence packing
- On the orientation of graphs and hypergraphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Packing arborescences
- Packing mixed hyperarborescences
- Packing of arborescences with matroid constraints via matroid intersection
- Packing of maximal independent mixed arborescences
- Reachability in arborescence packings
- Rigidity of multi-graphs. I: Linking rigid bodies in n-space
- Rooted \(k\)-connections in digraphs
- Rooted-tree decompositions with matroid constraints and the infinitesimal rigidity of frameworks with boundaries
- Variations for Lovász’ Submodular Ideas
This page was built for publication: Matroid-reachability-based decomposition into arborescences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906714)
