On the Minimum Cut of Planarizations

DOI10.1016/j.endm.2007.01.036zbMath1291.05045OpenAlexW2015367356WikidataQ56977267 ScholiaQ56977267MaRDI QIDQ3439582

Carsten Gutwenger, Markus Chimani, 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

minimum cutcrossing numbergraph planarization

Mathematics Subject Classification ID

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

Related Items (5)

Characterizing 2-crossing-critical graphs ⋮ Crossing number additivity over edge cuts ⋮ Most balanced minimum cuts ⋮ Non-planar core reduction of graphs ⋮ On the Minimum Cut of Planarizations

Cites Work

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

This page was built for publication: On the Minimum Cut of Planarizations