Generation of Symmetric and Asymmetric Biconnected Rooted Triangulated Planar Graphs
Bingbing Zhuang, Hiroshi Nagamochi · IEICE Transactions on Information and Systems · 2011
In a rooted triangulated planar graph, an outer vertex and two outer edges incident to it are designated as its root, respectively. Two plane embeddings of rooted triangulated planar graphs are defined to be equivalent if they admit an isomorphism such that the designated roots correspond to each other. Given a positive integer n, we give an O(n)-space and O(1)-time delay algorithm that generates all biconnected rooted triangulated planar graphs with at most n vertices without delivering two reflectively symmetric copies.