The following pages link to (Q3858297):
Displayed 17 items.
- Covering directed graphs by in-trees (Q626455) (← links)
- Restricted covering of digraphs with arborescences (Q913812) (← links)
- Packing arborescences in random digraphs (Q1689982) (← links)
- Blocking unions of arborescences (Q1751195) (← links)
- The \(b\)-branching problem in digraphs (Q2192110) (← links)
- Packing branchings under cardinality constraints on their root sets (Q2225417) (← links)
- Edge-disjoint branchings in temporal digraphs (Q2236804) (← links)
- An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph (Q2656340) (← links)
- Optimal Matching Forests and Valuated Delta-Matroids (Q3009779) (← links)
- Covering Directed Graphs by In-Trees (Q3511356) (← links)
- The Minimum Weight In-Tree Cover Problem (Q3627688) (← links)
- Polyhedra related to a lattice (Q3911666) (← links)
- Packing Arborescences in Random Digraphs (Q4627483) (← links)
- (Q5005108) (← links)
- Edge-Disjoint Branchings in Temporal Graphs (Q5041184) (← links)
- Digraph analogues for the Nine Dragon Tree Conjecture (Q6046686) (← links)
- On an \(f\)-coloring generalization of linear arboricity of multigraphs (Q6184546) (← links)