Minimal Disconnected Cuts in Planar Graphs

DOI10.1007/978-3-319-22177-9_19zbMath1434.68361MaRDI QIDQ2947884

Daniël Paulusma, Marcin Kaminski, Dimitrios M. Thilikos, Anthony Stewart

Publication date: 29 September 2015

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/16142/1/16142.pdf

zbMATH Keywords

connectivity; planar graph; vertex cut

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

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

05C83: Graph minors

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C40: Connectivity