In-trees and plane embeddings of outerplanar graphs |
| |
Authors: | Maciej M. Sysło Pawel Winter |
| |
Affiliation: | (1) Institute of Computer Science, University of Wrocaw, Przesmyckiego 20, PL-51151 Wrocaw, Poland;(2) Institute of Datalogy, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen Ø, Denmark |
| |
Abstract: | A notion of anin-tree is introduced. It is then used to characterize and count plane embeddings of outerplanar graphs. In-trees have also been applied in the study of independent vertex covers of faces in outerplanar graphs.This research was partially supported by the grant RP.I.09, from the Institute of Informatics, University of Warsaw. Hospitality of the Institute of Datalogy, University of Copenhagen where this research has been completed is gratefully acknowledged. |
| |
Keywords: | E.1 G.2.2 |
本文献已被 SpringerLink 等数据库收录! |
|