On triconnected and cubic plane graphs on given point sets

Abstract

We show how to construct a 3-connected plane graph on a given vertex set S and with the minimum number of edges.

Keywords

• triconnected
• cubic
• plane
• graphs
• given
• point
• sets