Results 171 to 180 of about 414,139 (194)
Some of the next articles are maybe not open access.
Independent covers in outerplanar graphs
1988A subset U of vertices of a plane graph is said to be a perfect face-independent vertex cover (FIVC) if and only if each face has exactly one vertex in U. Necessary and sufficient conditions for a maximal plane graph to have a perfect FIVC are derived.
Maciej M. Syslo, Pawel Winter
openaire +2 more sources
Approximating the pathwidth of outerplanar graphs
Information Processing Letters, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rajeev Govindan +2 more
openaire +2 more sources
An algorithm for outerplanar graphs with parameter
Journal of Algorithms, 1991Summary: For \(n\)-vertex outerplanar graphs, it is proven that \(O(n^{2.87})\) is an upper bound on the number of breakpoints of the function which gives the maximum weight of an independent set, where the vertex weights vary as linear functions of a parameter. An \(O(n^{2.87})\) algorithm for finding the solution is proposed.
Binghuan Zhu, Wayne Goddard
openaire +2 more sources
Centers of maximal outerplanar graphs
Journal of Graph Theory, 1980AbstractThe 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.
openaire +3 more sources
A note on domination number in maximal outerplanar graphs
Discrete Applied Mathematics, 2021Chanjuan Liu
exaly
Total domination in maximal outerplanar graphs
Discrete Applied Mathematics, 2017Elizabeth Jonck
exaly
On dominating sets of maximal outerplanar graphs
Discrete Applied Mathematics, 2013Yoshiko Wakabayashi, C N Campos
exaly