𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for outerplanar graphs with parameter

✍ Scribed by Binghuan Zhu; Wayne Goddard

Book ID
103628336
Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
328 KB
Volume
12
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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