Packing of spanning mixed arborescences
From MaRDI portal
Publication:6056788
DOI10.1002/jgt.22702zbMath1522.05374arXiv2005.03218OpenAlexW3166967332MaRDI QIDQ6056788
Publication date: 4 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.03218
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Arc-disjoint in-trees in directed graphs
- Old and new results on packing arborescences in directed hypergraphs
- Packing of maximal independent mixed arborescences
- Packing branchings under cardinality constraints on their root sets
- On reachability mixed arborescence packing
- On Maximal Independent Arborescence Packing
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Arc‐disjoint arborescences of digraphs
- Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings
- Matroid-Based Packing of Arborescences