The following pages link to Edge-augmentation of hypergraphs (Q1300051):
Displaying 8 items.
- Maximally edge-connected hypergraphs (Q501024) (← links)
- Covering symmetric supermodular functions by uniform hypergraphs (Q598465) (← links)
- Successive edge-connectivity augmentation problems (Q1300062) (← links)
- Edge-connectivity in hypergraphs (Q2065350) (← links)
- Sufficient conditions for hypergraphs to be maximally edge-connected (Q2335157) (← links)
- Minimum Cuts and Sparsification in Hypergraphs (Q4561257) (← links)
- (Q5210490) (← links)
- Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\) (Q6608037) (← links)
