On the Minimum Cut of Planarizations

DOI10.1016/J.ENDM.2007.01.036MaRDI QIDQ3439582zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Markus Chimani, Carsten Gutwenger, Petra Mutzel

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2007.01.036

zbMATH Keywords

crossing numbergraph planarizationminimum cut

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• How to draw the minimum cuts of a planar graph
• scientific article; zbMATH DE number 2080090
• On graph crossing number and edge planarization
• scientific article; zbMATH DE number 2075842
• Minimum s-t cut in undirected planar graphs when the source and the sink are close

Cites work

• Additivity of the crossing number of graphs with connectivity 2
• Crossing Number is NP-Complete
• Experiments on Exact Crossing Minimization Using Column Generation
• Graph Drawing
• On the Minimum Cut of Planarizations

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)