Results 141 to 150 of about 3,679 (179)
A self-stabilizing algorithm for locating the center of Cartesian product of K2 and maximal outerplanar graphs [PDF]
Annals of computer science and information systems, 2014 Halina Bielak, Michał Pańczyk
doaj +1 more source
Computational analysis of noncoding RNAs. [PDF]
Wiley Interdiscip Rev RNA, 2012 Washietl S +6 more
europepmc +1 more source
Outer connected domination in maximal outerplanar graphs and beyond
Discussiones Mathematicae Graph TheoryWei Yang, Baoyindureng Wu
doaj +1 more source
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
Testing Outerplanarity of Bounded Degree Graphs
Algorithmica, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yoshida, Yuichi, Ito, Hiro
openaire +1 more source
On list‐coloring outerplanar graphs
Journal of Graph Theory, 2008AbstractWe prove that a 2‐connected, outerplanar bipartite graph (respectively, outerplanar near‐triangulation) with a list of colors L (v ) for each vertex v such that $|L(v)|\geq\min\{{\deg}(v),4\}$ (resp., $|L(v)|\geq{\min}\{{\deg}(v),5\}$) can be L‐list‐colored (except when the graph is K3 with identical 2‐lists).
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 +1 more source