Results 171 to 180 of about 1,056 (209)
Generalized outerplanar Turán number of short paths [PDF]
Discrete Mathematics, 2023 Let H be a graph. The generalized outerplanar Turán number of H, denoted by fOP(n,H), is the maximum number of copies of H in an n-vertex outerplanar graph. Let Pk denote a path on k vertices.
Ervin Gyori, Chuanqi Xiao
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
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
Augmenting the Connectivity of Outerplanar Graphs
Algorithmica, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alfredo García Olaverri +3 more
openaire +2 more sources
On the Orthogonal Drawing of Outerplanar Graphs
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2004In 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 +2 more
openaire +1 more source
Independent domination in outerplanar graphs
Discrete Applied Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wayne Goddard, Michael A. Henning
openaire +1 more source
A characterization of ?-outerplanar graphs
Journal of Graph Theory, 1996Chartrand 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 CombinatoricszbMATH 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, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huilan Chang, Hung-Lin Fu, Min-Yun Lien
openaire +2 more sources