Results 171 to 180 of about 2,073 (195)
Some of the next articles are maybe not open access.
Multiterminal flows in outerplanar networks
Journal of Algorithms, 1983Abstract An outerplanar network is an undirected network whose underlying graph is a triangulation of a polygon. We give a linear algorithm for finding maximum flow values between all pairs of nodes in the outerplanar network. Our algorithm constructs the cut-tree of the outerplanar network without using any maximum flow computation.
T. C. Hu, M. T. Shing
openaire +3 more sources
On list‐coloring outerplanar graphs
Journal of Graph Theory, 2008AbstractWe 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 +3 more sources
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
Proximity Drawings of Outerplanar Graphs.
1997A proximity drawing of a graph is one in which pairs of adjacent vertices are drawn relatively close together according to some proximity measure while pairs of non-adjacent vertices are drawn relatively far apart. The fundamental question concerning proximity drawability is: Given a graph G and a definition of proximity, is it possible to construct a ...
W. Lenhart, LIOTTA, Giuseppe
openaire +2 more sources
A Note on Domination Number in Maximal Outerplanar Graphs
Discrete Applied Mathematics, 2021Chanjuan Liu
exaly
Independent Domination in Outerplanar Graphs
Discrete Applied Mathematics, 2023Michael A. Henning, Wayne Dean Goddard
exaly
Total Domination in Maximal Outerplanar Graphs
Discrete Applied Mathematics, 2017Elizabeth Jonck
exaly

