Minimal disconnected cuts in planar graphs

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

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

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

connectivityplanar graphvertex cut

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Connectivity (05C40)

Related Items (2)

Disconnected cuts in claw-free graphs ⋮ Unnamed Item

This page was built for publication: Minimal disconnected cuts in planar graphs