Results 131 to 140 of about 1,769 (162)

Augmenting the Connectivity of Outerplanar Graphs

Algorithmica, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alfredo García Olaverri, Ferran Hurtado, Marc Noy, Javier Tejel   +3 more
openaire   +2 more sources

On the Orthogonal Drawing of Outerplanar Graphs

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2004
In this paper we show that an outerplanar graph G with maximum degree at most 3 has a 2-D orthogonal drawing with no bends if and only if G contains no triangles. We also show that an outerplanar graph G with maximum degree at most 6 has a 3-D orthogonal drawing with no bends if and only if G contains no triangles.
Kumiko Nomura, Satoshi Tayu, Shuichi Ueno   +2 more
openaire   +1 more source

Multiterminal flows in outerplanar networks

Journal of Algorithms, 1983
Abstract 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

A characterization of ?-outerplanar graphs

Journal of Graph Theory, 1996
Chartrand and Harary have shown that if G is a non-outerplanar graph such that, for every edge e, both the deletion G\e and the contraction G/e of e from G are outerplanar, then G is isomorphic to K4 or K2,3. An α-outerplanar graph is a graph which is not outerplanar such that, for some edge α, both G\α and G/α are outerplanar.
openaire   +2 more sources

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   +3 more sources

The $$p-$$Arboricity of Outerplanar Graphs

Graphs and Combinatorics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mingyuan Ma, Han Ren
openaire   +1 more source

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   +2 more sources

The decycling number of outerplanar graphs

Journal of Combinatorial Optimization, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huilan Chang, Hung-Lin Fu, Min-Yun Lien
openaire   +3 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

Proximity Drawings of Outerplanar Graphs.

1997
A 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