Convex embeddings and bisections of 3-connected graphs

DOI10.1007/s00493-002-0006-8zbMath1026.05069OpenAlexW2060623579MaRDI QIDQ1410408

Toshihide Ibaraki, Yoshitaka Nakao, Hiroshi Nagamochi, Tibor Jordán

Publication date: 14 October 2003

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-002-0006-8

zbMATH Keywords

connectivityconvex embeddingsham-sandwich cut

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items

Bisecting a 4-connected graph with three resource sets, A robust algorithm for bisecting a triconnected graph with two resource sets