Results 151 to 159 of about 3,901 (159)
Some of the next articles are maybe not open access.
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
Embedding Outerplanar Graphs in Small Books
SIAM Journal on Algebraic Discrete Methods, 1987A book consists of a number of half-planes (pages) sharing a common boundary line (the spine). A book embedding of a graph embeds the vertices on the spine and each edge in some page so that each page contains a plane subgraph. The width of a page is the maximum number of edges that intersect any half-line perpendicular to the spine in the page.
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
Augmenting the Connectivity of Outerplanar Graphs
Algorithmica, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
García, A. +3 more
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
Generalized steiner problem in outerplanar networks
BIT, 1985The generalized Steiner problem in a network is considered. The generalization consists in the requirement that some vertices satisfy certain pairwise (vertex or edge) connectivity constraints. The general problem was known to be NP-complete, but for the case when the underlying network is outerplanar and the subnetwork is required to be biconnected ...
openaire +1 more source
Linear algorithms to recognize outerplanar and maximal outerplanar graphs
Information Processing Letters, 1979openaire +2 more sources