On the Number of Minimum Cuts in a Graph
From MaRDI portal
Recommendations
- On the number of minimum cuts in a graph
- Graphs with the smallest number of minimum cut sets
- The number of cut-vertices in a graph of given minimum degree
- The number of cutvertices in graphs with given minimum degree
- Counting the number of minimum cuts in undirected multigraphs
- On the number of cut-vertices in a graph
- The minimum size of graphs satisfying cut conditions
- Graphs with largest number of minimum cuts
- On the number of small cut in a graph
- scientific article; zbMATH DE number 3891429
Cited in
(20)- An improved algorithm for the longest induced path problem on \(k\)-chordal graphs
- Minimum cuts, girth and a spectral threshold
- Tight lower bounds for the number of inclusion-minimal \(st\)-cuts
- Efficient pattern matching on big uncertain graphs
- On the number of small cut in a graph
- On bounds for the cutting number of a graph
- Cutsets in perfect and minimal imperfect graphs
- Minimum cut with the fewest number of arcs
- Counting the number of minimum cuts in undirected multigraphs
- Simple enumeration of minimal cutsets separating 2 vertices in a class of undirected planar graphs
- Structural properties of the minimum cut of partially-supplied graphs
- Between min cut and graph bisection
- On the number of minimum cuts in a graph
- Counting and sampling minimum cuts in genus g graphs
- Minimal graph cuts on network subgraphs
- Results on hyperbolicity in graphs: a survey
- Minimum Cuts in Surface Graphs
- Covering a graph with cuts of minimum total size
- Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
- The mincut graph of a graph
This page was built for publication: On the Number of Minimum Cuts in a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4652629)