Results 181 to 190 of about 1,056 (209)

On list‐coloring outerplanar graphs

Journal of Graph Theory, 2008
AbstractWe prove that a 2‐connected, outerplanar bipartite graph (respectively, outerplanar near‐triangulation) with a list of colors L (v ) for each vertex v such that $|L(v)|\geq\min\{{\deg}(v),4\}$ (resp., $|L(v)|\geq{\min}\{{\deg}(v),5\}$) can be L‐list‐colored (except when the graph is K3 with identical 2‐lists).
openaire   +2 more sources

An algorithm for outerplanar graphs with parameter

Journal of Algorithms, 1991
Summary: 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

Approximating the pathwidth of outerplanar graphs

Information Processing Letters, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rajeev Govindan, Michael A. Langston, Xudong Yan   +2 more
openaire   +2 more sources

Independent covers in outerplanar graphs

1988
A 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   +1 more source

Centers of maximal outerplanar graphs

Journal of Graph Theory, 1980
AbstractThe 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   +2 more sources

The outerplanar crossing number of the complete bipartite graph

Discrete Applied Mathematics, 2022
Silvia Fernández-Merchant
exaly  

Outerplanar graph drawings with few slopes

Computational Geometry: Theory and Applications, 2014
Kolja Knauer, Piotr Micek, Bartosz Walczak   +2 more
exaly  

COLORING THE SQUARE OF AN OUTERPLANAR GRAPH

Taiwanese Journal of Mathematics, 2006
Ko-Wei Lih, Wei-Fan Wang
exaly  

The surviving rate of an outerplanar graph for the firefighter problem

Theoretical Computer Science, 2011
Weifan Wang
exaly  

Acquisition of characteristic sets of block preserving outerplanar graph patterns by a two-stage evolutionary learning method for graph pattern sets

International Journal of Computational Intelligence Studies, 2018
Fumiya Tokuhara, Tetsuhiro Miyahara, Tomoyuki Uchida   +2 more
exaly