Listing Triconnected Rooted Plane Graphs

A plane graph is a drawing of a planar graph in the plane such that no two edges cross each other. A rooted plane graph has a designated outer vertex. For given positive integers n 1 and g 3, let G3(n, g) denote the set of all triconnected rooted plane graphs with exactly n vertices such that the size of each inner face is at most g. In this paper, we give an algorithm that enumerates all plane graphs in G3(n, g). The algorithm runs in constant time per each by outputting the difference from the previous output.

• Type: Journal
• Year: 2010
• Where: COCOA
• Authors: Bingbing Zhuang, Hiroshi Nagamochi
• Keywords: COCOA 2010, Discrete Geometry, Planar Graph, Plane Graphs, Rooted Plane Graph