Minimal disconnected cuts in planar graphs

DOI10.1002/net.21696zbMath1434.68362MaRDI QIDQ4642401

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

Publication date: 23 May 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/19878/1/19878.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