Outerplanar Graphs and Weak Duals

Outerplanar Graphs and Weak Duals
复制标题

外平面图和弱对偶图

DOI：
--
复制
发表时间：
1974
期刊：
影响因子：
--
通讯作者：
F. Harary
F. Harary
中科院分区：
--
文献类型：
--
作者：
H. Fleischner;D. Geller;F. Harary

文献摘要

被引文献

相似文献

如果一个平面图能够嵌入平面中，使得每个点都位于外部区域，那么它就是外平面图。Chartrand和Harary[1]将外平面图的特征描述为那些包含同胚于\(K_4\)或\(K_{2,3}\)的子图的图。在本文中，我们从对偶的角度给出外平面图的另一种特征描述，并讨论外平面图的点的度数与其内部区域边界长度之间的一些关系。
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 K 4 or K 2,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.