On the Minimum Cut of Planarizations
From MaRDI portal
Recommendations
Cites work
Cited in
(10)- Non-planar core reduction of graphs
- On minimum cuts and the linear arrangement problem
- How to draw the minimum cuts of a planar graph
- Crossing number additivity over edge cuts
- Characterizing 2-crossing-critical graphs
- On the Minimum Cut of Planarizations
- Computing the Map of Geometric Minimal Cuts
- Simple enumeration of minimal cutsets separating 2 vertices in a class of undirected planar graphs
- scientific article; zbMATH DE number 2080090 (Why is no real title available?)
- Most balanced minimum cuts
This page was built for publication: On the Minimum Cut of Planarizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439582)