We consider different plane embeddings of partial 2-trees, count them and. give an efficient algorithm constructing a minimum cardinality cover of faces by vertices. These tasks are facilitated by a unique tree representation of plane embeddings of 2-trees.