Results 151 to 160 of about 3,724 (174)

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

Independent domination in outerplanar graphs

Discrete Applied Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Goddard, Wayne, Henning, Michael A.
openaire   +1 more source

Embedding Outerplanar Graphs in Small Books

SIAM Journal on Algebraic Discrete Methods, 1987
A 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

Augmenting the Connectivity of Outerplanar Graphs

Algorithmica, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
García, A., Hurtado, F., Noy, M., Tejel, J.   +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

Farey Series and Maximal Outerplanar Graphs

SIAM Journal on Algebraic Discrete Methods, 1982
Certain graphs representing Farey series of irreducible fractions are shown to be maximal outerplanar. For a suitable generalization of Farey series, the class of graphs obtained is exactly the class of maximal outerplanar graphs. Using a representation of maximal outerplanar graphs as series of irreducible fractions, efficient algorithms for deciding ...
openaire   +2 more sources

Independent covers in outerplanar graphs

1988
A subset U of vertices of a plane graph is said to be a perfect face-independent vertex cover (FIVC) if and only if each face has exactly one vertex in U. Necessary and sufficient conditions for a maximal plane graph to have a perfect FIVC are derived.
Maciej M. Syslo, Paweł Winter
openaire   +1 more source

A note on domination number in maximal outerplanar graphs

Discrete Applied Mathematics, 2021
Chanjuan Liu
exaly  

Partial domination of maximal outerplanar graphs

Discrete Applied Mathematics, 2020
Peter Borg, Pawaton Kaemawichanurat
exaly  

On the packing chromatic number of subcubic outerplanar graphs

Discrete Applied Mathematics, 2019
Přemysl Holub, Olivier Togni
exaly