Pages that link to "Item:Q4319529"
From MaRDI portal
The following pages link to An exact lower bound on the number of cut‐sets in multigraphs (Q4319529):
Displaying 8 items.
- A sharp upper bound for the number of stable sets in graphs with given number of cut edges (Q1033025) (← links)
- Tight lower bounds for the number of inclusion-minimal \(st\)-cuts (Q1627159) (← links)
- The minimum size of graphs satisfying cut conditions (Q1701098) (← links)
- Graphs with largest number of minimum cuts (Q1917282) (← links)
- On bounds for the cutting number of a graph (Q2392551) (← links)
- Tight Bounds for Gomory-Hu-like Cut Counting (Q3181053) (← links)
- Graphs with the smallest number of minimum cut sets (Q3344017) (← links)
- Counting the number of minimum cuts in undirected multigraphs (Q3987534) (← links)