Results 131 to 140 of about 231 (167)

Linear algorithms to recognize outerplanar and maximal outerplanar graphs

Information Processing Letters, 1979
exaly   +3 more sources

Outerplanar Thrackles

Graphs and Combinatorics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grant Cairns, Yury Nikolayevsky
openaire   +2 more sources

Augmenting Outerplanar Graphs

Journal of Algorithms, 1996
Summary: We show that for outerplanar graphs \(G\) the problem of augmenting \(G\) by adding a minimum number of edges such that the augmented graph \(G'\) is planar and bridge-connected, biconnected, or triconnected can be solved in linear time and space.
openaire   +3 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

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

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

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

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

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