The following pages link to On two minimax theorems in graph (Q1229885):
Displaying 15 items.
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths (Q4986808) (← links)
- (Q5005108) (← links)
- Edge-Disjoint Branchings in Temporal Graphs (Q5041184) (← links)
- Representing non-crossing cuts by phylogenetic trees (Q5061705) (← links)
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs (Q5101431) (← links)
- Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings (Q5219667) (← links)
- Independent spanning trees with small depths in iterated line digraphs (Q5936460) (← links)
- Anti-forcing numbers of perfect matchings of graphs (Q5962519) (← links)
- Integral packing of branchings in capacitaded digraphs (Q5963635) (← links)
- On the infinite Lucchesi–Younger conjecture I (Q6056771) (← links)
- Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2 (Q6081563) (← links)
- Good acyclic orientations of 4‐regular 4‐connected graphs (Q6081883) (← links)
- On an \(f\)-coloring generalization of linear arboricity of multigraphs (Q6184546) (← links)
- Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs (Q6201032) (← links)
- Arc-disjoint out- and in-branchings in compositions of digraphs (Q6568855) (← links)