A generalization of outerplanar graphs (Q799687)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A generalization of outerplanar graphs |
scientific article; zbMATH DE number 3873356
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A generalization of outerplanar graphs |
scientific article; zbMATH DE number 3873356 |
Statements
A generalization of outerplanar graphs (English)
0 references
1984
0 references
A graph G is said to be W-outerplanar if it can be embedded in the plane so that all vertices of a given set \(W\subset V(G)\) lie on the boundary of one face. A characterization of such graphs is given by means of forbidden subgraphs, and an algorithm for W-outerplanarity testing is described. The results overlap, in part, with those of \textit{V. P. Nekrasov} [Combinatorial properties of convex sets and graphs, Collect. Artic., Sverdlovsk 1983, 34-44 (1983; Zbl 0517.05029)].
0 references
outerplanar graph
0 references
forbidden subgraphs
0 references
