Results 171 to 180 of about 5,384 (188)
Some of the next articles are maybe not open access.

A characterization of ?-outerplanar graphs

Journal of Graph Theory, 1996
Chartrand 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, 2008
zbMATH 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 Combinatorics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mingyuan Ma, Han Ren
openaire   +1 more source

Generalized steiner problem in outerplanar networks

BIT, 1985
The 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

Independent domination in outerplanar graphs

Discrete Applied Mathematics, 2023
W. Goddard, Michael A. Henning
semanticscholar   +1 more source

A note on domination number in maximal outerplanar graphs

Discrete Applied Mathematics, 2021
Chanjuan Liu
semanticscholar   +1 more source

Proper conflict-free degree-choosability of outerplanar graphs

Discrete Mathematics
Masaki Kashima   +2 more
semanticscholar   +1 more source

An odd 4-coloring of a maximal outerplanar graph

Discrete Mathematics
Masaki Kashima   +4 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy