Graphs with the smallest number of minimum cut sets
From MaRDI portal
Publication:3344017
Recommendations
Cited in
(22)- Optimally reliable networks
- Super edge-connectivity of dense digraphs and graphs
- Number of minimum vertex cuts in transitive graphs
- On the number of small cut in a graph
- Graphs with largest number of minimum cuts
- Solution methods for the vertex variant of the network system vulnerability analysis problem
- Minimal 2-connected graphs satisfying the even cut condition
- Cutsets in perfect and minimal imperfect graphs
- Minimum weight resolving sets of grid graphs
- Minimum cut with the fewest number of arcs
- scientific article; zbMATH DE number 5131681 (Why is no real title available?)
- Counting the number of minimum cuts in undirected multigraphs
- Optimally Reliable Graphs for Both Vertex and Edge Failures
- An exact lower bound on the number of cut‐sets in multigraphs
- From connectivity to coloring
- On the Number of Minimum Cuts in a Graph
- scientific article; zbMATH DE number 1404133 (Why is no real title available?)
- Smallest Graphs Achieving the Stinson Bound
- scientific article; zbMATH DE number 6783459 (Why is no real title available?)
- Minimal graph cuts on network subgraphs
- Minimum Cuts in Surface Graphs
- Superconnectivity for minimal multi-loop networks
This page was built for publication: Graphs with the smallest number of minimum cut sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3344017)
