Results 161 to 170 of about 2,073 (195)
Outerplanar Graph Drawings With Few Slopes [PDF]
Computational Geometry: Theory and Applications, 2014 International audienceWe consider straight-line outerplanar drawings of outerplanar graphs in which a small number of distinct edge slopes are used, that is, the segments representing edges are parallel to a small number of directions.
Piotr Micek +2 more
exaly +13 more sources
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 Győri +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Linear Algorithms to Recognize Outerplanar and Maximal Outerplanar Graphs
Information Processing Letters, 1979exaly +4 more sources
Graphs and Combinatorics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grant Cairns, Yury Nikolayevsky
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grant Cairns, Yury Nikolayevsky
openaire +2 more sources
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 +4 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 +4 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
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 +2 more sources
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 +3 more sources