Results 151 to 160 of about 5,384 (188)
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 +3 more sources
Odd 4-Coloring of Outerplanar Graphs
Graphs and CombinatoricsA proper k-coloring of G is called an odd coloring of G if for every vertex v, there is a color that appears at an odd number of neighbors of v. This concept was introduced recently by Petruševski and Škrekovski, and they conjectured that every planar ...
Masaki Kashima, Xuding Zhu
semanticscholar +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Graphs and Combinatorics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cairns, Grant, Nikolayevsky, Yury
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cairns, Grant, Nikolayevsky, Yury
openaire +2 more sources
Outerplanar and Forest Storyplans
Conference on Current Trends in Theory and Practice of Informatics, 2023We study the problem of gradually representing a complex graph as a sequence of drawings of small subgraphs whose union is the complex graph. The sequence of drawings is called \emph{storyplan}, and each drawing in the sequence is called a \emph{frame ...
Jivr'i Fiala +4 more
semanticscholar +1 more source
Efficient outerplanarity testing
Fundamenta Informaticae, 1979This paper describes an efficient algorithm for finding whether a graph G has an outerplanar embedding in the plane. The algorithm is a realization of an inductive characterization of outerplanar graphs and uses depth-first search for coding a structure of a graph which is represented by adjacency lists.
Syslo, Maciej M., Iri, Masao
openaire +2 more sources
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
Large induced subgraph with a given pathwidth in outerplanar graphs
arXiv.orgA long-standing conjecture by Albertson and Berman states that every planar graph of order $n$ has an induced forest with at least $\lceil \frac{n}{2} \rceil$ vertices.
Naoki Matsumoto, Takamasa Yashima
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
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
Outerplanar graphs with positive Lin-Lu-Yau curvature
Journal of CombinatoricsIn this paper, we show that all simple outerplanar graphs $G$ with minimum degree at least $2$ and positive Lin-Lu-Yau Ricci curvature on every edge have maximum degree at most $9$.
George Brooks +4 more
semanticscholar +1 more source