๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Linear algorithms to recognize outerplanar and maximal outerplanar graphs

โœ Scribed by Sandra L. Mitchell

Book ID
113162084
Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
490 KB
Volume
9
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Maxregularity and Maximal Outerplanar Gr
Maxregularity and Maximal Outerplanar Graphs
โœ R.M.N.D. Rodrigues; N.M.M. Abreu; L. Markenzon ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 269 KB
Centers of maximal outerplanar graphs
Centers of maximal outerplanar graphs
โœ Andrzej Proskurowski ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 178 KB

## Abstract The center of a graph is defined to be the subgraph induced by the set of vertices that have minimum eccentricities (i.e., minimum distance to the most distant vertices). It is shown that only seven graphs can be centers of maximal outerplanar graphs.

An Optimal Simple Parallel Algorithm for
An Optimal Simple Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs
โœ Shan-Chyun Ku; Biing-Feng Wang ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 91 KB

An outerplanar graph is a planar graph that can be imbedded in the plane in such a way that all vertices lie on the exterior face. An outerplanar graph is maximal if no edge can be added to the graph without violating the outerplanarity. In this paper, an optimal parallel algorithm is proposed on th