✦ LIBER ✦

The reconstruction of outerplanar graphs

✍ Scribed by William B Giles

Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 746 KB
Volume: 16
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(74)90066-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reconstruction of maximal outerplanar gr

Reconstruction of maximal outerplanar graphs

✍ Bennet Manvel 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 1011 KB

On reconstructing maximal outerplanar gr

On reconstructing maximal outerplanar graphs

✍ William B. Giles 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 421 KB

Let C; be a graph, u a vertex of G, and G -{u) the subgraph of G obtained from G by removing the vertex u and all arcs incident with u. G-$1 is calted a point~e~eti~n of G. In f 51, Ulam conjectured that if G has at least three vertices, then G can be reconstructed (up to isomorphism) froin the coil

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

Characterizations of outerplanar graphs

✍ Maciej M. Sysło 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 750 KB

The paper presents several characterizations of outerp:anar graphs, some of them are counterparts of the well-known characterizations of planar graphs and the other provide very efficient tools for outerplanarity testing, coding (i.e. isomorphism testing), and counting such graphs. Finally, we attem

On the colorings of outerplanar graphs

✍ Weifan Wang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 601 KB

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.