A generalization of outerplanar graphs
Copyright policy )A generalization of outerplanar graphs
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)].
- National University of La Plata Argentina
outerplanar graph, Discrete Mathematics and Combinatorics, Planar graphs; geometric and topological aspects of graph theory, forbidden subgraphs, Theoretical Computer Science
outerplanar graph, Discrete Mathematics and Combinatorics, Planar graphs; geometric and topological aspects of graph theory, forbidden subgraphs, Theoretical Computer Science
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).6 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!