Regular packing of rooted hyperforests with root constraints in hypergraphs
From MaRDI portal
Cites work
- Arc-disjoint in-trees in directed graphs
- Connections in combinatorial optimization
- Edge-Disjoint Spanning Trees of Finite Graphs
- scientific article; zbMATH DE number 3427360 (Why is no real title available?)
- scientific article; zbMATH DE number 31498 (Why is no real title available?)
- scientific article; zbMATH DE number 3799695 (Why is no real title available?)
- Matroid-Based 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 packing spanning arborescences with matroid constraint
- On the Complexity of General Graph Factor Problems
- On the orientation of graphs and hypergraphs
- On the Problem of Decomposing a Graph into n Connected Factors
- On two minimax theorems in graph
- Packing arborescences
- Packing mixed hyperarborescences
- Packing of arborescences with matroid constraints via matroid intersection
- Packing of maximal independent mixed arborescences
- Packing of mixed hyperarborescences with flexible roots via matroid intersection
- Packing of spanning mixed arborescences
- Polymatroid-based capacitated packing of branchings
- Reachability in arborescence packings
- Rooted \(k\)-connections in digraphs
- Rooted-tree decompositions with matroid constraints and the infinitesimal rigidity of frameworks with boundaries
- Supermodularity in unweighted graph optimization. I: Branchings and matchings
- The complexity of satisfiability problems
- Transversals and matroid partition
- Variations for Lovász’ Submodular Ideas
Cited in
(2)
This page was built for publication: Regular packing of rooted hyperforests with root constraints in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6932167)
