𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Centers of maximal outerplanar graphs

✍ Scribed by Andrzej Proskurowski

Publisher
John Wiley and Sons
Year
1980
Tongue
English
Weight
178 KB
Volume
4
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

Pathwidth of outerplanar graphs
Pathwidth of outerplanar graphs
✍ David Coudert; Florian Huc; Jean-SΓ©bastien Sereni πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 238 KB

## Abstract We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved that the pathwidth of every biconnected outerplanar graph is always at most twice the pathwidth of its (geo

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

A characterization of ?-outerplanar grap
A characterization of ?-outerplanar graphs
✍ Wargo, Lawrence πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 528 KB

Chartrand and Harary have shown that if G is a non-outerplanar graph such that, for every edge e, both the deletion G \ e and the contraction G/e of e from G are outerplanar, then G is isomorphic to K4 or K2,3. An a-outerplanar graph is a graph which is not outerplanar such that, for some edge a , b

Outerplanar Partitions of Planar Graphs
Outerplanar Partitions of Planar Graphs
✍ Kiran S. Kedlaya πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 254 KB

An outerplanar graph is one that can be embedded in the plane so that all of the vertices lie on one of the faces. We investigate a conjecture of Chartrand, Geller, and Hedetniemi, that every planar graph can be edge-partitioned into two outerplanar subgraphs. We refute the stronger statement that e

Game chromatic number of outerplanar gra
Game chromatic number of outerplanar graphs
✍ Guan, D. J.; Zhu, Xuding πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 172 KB πŸ‘ 2 views

This note proves that the game chromatic number of an outerplanar graph is at most 7. This improves the previous known upper bound of the game chromatic number of outerplanar graphs.