Results 141 to 150 of about 969,499 (193)
Some of the next articles are maybe not open access.
Linear algorithms to recognize outerplanar and maximal outerplanar graphs
Information Processing Letters, 1979exaly +3 more sources
Zero Forcing on 2-connected Outerplanar Graphs
Graphs and Combinatorics, 2023We determine upper and lower bounds on the zero forcing number of 2-connected outerplanar graphs in terms of the structure of the weak dual. We show that the upper bound is always at most half the number of vertices in the graph.
Nolan Ison +2 more
semanticscholar +1 more source
A tight local algorithm for the minimum dominating set problem in outerplanar graphs
International Symposium on Distributed Computing, 2021We show that there is a deterministic local algorithm (constant-time distributed graph algorithm) that finds a 5-approximation of a minimum dominating set on outerplanar graphs.
Marthe Bonamy +3 more
semanticscholar +1 more source
Oriented diameter of maximal outerplanar graphs
Journal of Graph Theory, 2021Let G be a finite connected undirected graph and G ⇀ a strong orientation of G . The diameter of G ⇀ , denoted by d i a m ( G ⇀ ) , is the maximum directed distance between any two vertices of G ⇀ . The oriented diameter of G is defined as d i a m ⇀ ( G )
Xiaolin Wang +5 more
semanticscholar +1 more source
Isolation number of maximal outerplanar graphs
Discrete Applied Mathematics, 2019 A subset S of vertices in a graph G is called an isolating set if V ( G ) ∖ N G [ S ] is an independent set of G . The isolation number ι ( G ) is the minimum cardinality of an isolating set of G . Let G be a maximal outerplanar graph of order n with n 2
Pawaton Kaemawichanurat
exaly +2 more sources
Shortest Beer Path Queries in Outerplanar Graphs
Algorithmica, 2021A beer graph is an undirected graph G , in which each edge has a positive weight and some vertices have a beer store. A beer path between two vertices u and v in G is any path in G between u and v that visits at least one beer store.
Joyce Bacic, S. Mehrabi, M. Smid
semanticscholar +1 more source
Proper conflict-free degree-choosability of outerplanar graphs
Discrete MathematicsA proper coloring $\phi$ of $G$ is called a proper conflict-free coloring of $G$ if for every non-isolated vertex $v$ of $G$, there is a color $c$ such that $|\phi^{-1}(c)\cap N_G(v)|=1$.
Masaki Kashima +2 more
semanticscholar +1 more source
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
Unsplittable Multicommodity Flows in Outerplanar Graphs
Conference on Integer Programming and Combinatorial OptimizationWe consider the problem of multicommodity flows in outerplanar graphs. Okamura and Seymour showed that the cut-condition is sufficient for routing demands in outerplanar graphs.
David Alem'an-Espinosa, Nikhil Kumar
semanticscholar +1 more source
Proximity and radius in outerplanar graphs with bounded faces
Discrete MathematicsLet $G$ be a finite, connected graph and $v$ a vertex of $G$. The average distance and the eccentricity of $v$ in $G$ are defined as the arithmetic mean and the maximum, respectively, of the distances from $v$ to all other vertices of $G$.
P. Dankelmann +2 more
semanticscholar +1 more source