𝔖 Bobbio Scriptorium
✦   LIBER   ✦

In-trees and plane embeddings of outerplanar graphs

✍ Scribed by Maciej M. Sysło; Pawel Winter

Publisher
Springer Netherlands
Year
1990
Tongue
English
Weight
398 KB
Volume
30
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Chromatic polynomials, polygon trees, an
Chromatic polynomials, polygon trees, and outerplanar graphs
✍ C. D. Wakelin; D. R. Woodall 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 370 KB

## Abstract It is proved that all classes of polygon trees are characterized by their chromatic polynomials, and a characterization is given of those polynominals that are chromatic polynomials of outerplanar graphs. The first result yields an alternative proof that outerplanar graphs are recogniza

Cuts, Trees and ℓ1-Embeddings of Graphs*
Cuts, Trees and ℓ1-Embeddings of Graphs*
✍ Anupam Gupta†; Ilan Newman; Yuri Rabinovich; Alistair Sinclair‡ 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 458 KB
Algorithms and outerplanar conditions fo
Algorithms and outerplanar conditions for A-trails in plane Eulerian graphs
✍ Lars Døvling Andersen; Herbert Fleischner; Susanne Regner 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 834 KB

The problem of finding A-trails in plane Eulerian graphs is &'P-complete even for 3-connected graphs, as shown by the first two authors in an earlier paper. In the present paper, we discuss sufficient conditions for the existence of an A-trail in a 2-connected plane Eulerian graph. They generalize t

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