On the two-connected planar spanning subgraph polytope
The authors investigate the problem of finding a two-connected spanning planar subgraph of maximum weight in a complete edge-weighted graph, from a polyhedral point of view. The problem is important in automatic graph drawing.
scientific article; zbMATH DE number 1133174