Abstract Views :270 |
PDF Views:0
Authors
Affiliations
1 Institute for Advanced Study, IN
2 Austrian Academy of Sciences,
SUNY at Binghamton, US
3 University of Oxford, GB
Source
The Journal of the Indian Mathematical Society, Vol 38, No 1-4 (1974), Pagination: 215-219
Abstract
A planar graph is outer planar if it can be embedded irr the plane so that every point lies on the exterior region. Outerplanar graphs were characterized by Chartrand and Harary [1] as those graphs containing subgraphs homeomorphic onto K4 or K2,3. In this paper we present an alternate characterization of outerplanar graphs in terms of duals, and discuss some relationships between the degrees of the points of outerplanar graphs and the lengths of the boundaries of their interior regions.