Results 191 to 199 of about 119,166 (199)

On the Maximum Spread of Planar and Outerplanar Graphs

Zelong Li, William Linz, Linyuan Lü, Zhiyu Wang   +3 more
openalex   +1 more source

On the Orthogonal Drawing of Outerplanar Graphs [PDF]

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

Some of the next articles are maybe not open access.

Related searches:

Augmenting Outerplanar Graphs

Journal of Algorithms, 1996
In this paper, we show that for outerplanar graphsGthe problem of augmentingGby adding a minimum number of edges such that the augmented graphGÂ? is planar and bridge-connected, biconnected, or triconnected can be solved in linear time and space. It is also shown that augmenting a biconnected outerplanar graph to a maximal outerplanar graph while ...
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

An algorithm for outerplanar graphs with parameter

Journal of Algorithms, 1991
Abstract For n-vertex outerplanar graphs, it is proven that O(n2.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(n2.87) algorithm for finding the solution is proposed.
Binghuan Zhu, Wayne Goddard
openaire   +2 more sources

The decycling number of outerplanar graphs

Journal of Combinatorial Optimization, 2012
For a graph G, let ?(G) be the decycling number of G and c(G) be the number of vertex-disjoint cycles of G. It has been proved that c(G)≤?(G)≤2c(G) for an outerplanar graph G. An outerplanar graph G is called lower-extremal if ?(G)=c(G) and upper-extremal if ?(G)=2c(G).
Min-Yun Lien, Hung-Lin Fu, Huilan Chang
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. Sysło, Pawel Winter
openaire   +2 more sources

Linear algorithms to recognize outerplanar and maximal outerplanar graphs

Information Processing Letters, 1979
openaire   +1 more source

Parallel recognition of outerplanar graphs

1987
openaire   +2 more sources