Results 121 to 130 of about 2,073 (195)
Induced cycle structure and outerplanarity
Discrete Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Horizontal visibility graph of a random restricted growth sequence. [PDF]
Adv Appl Math, 2021 Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source
A map is outerplanar if all its vertices lie in the outer face. We enumerate various classes of rooted outerplanar maps with respect to the number of edges and vertices. The proofs involve several bijections with lattice paths.
Geffner, I., Noy Serrano, Marcos
core
ABSTRACT FOG: Finding Outerplanar Graphs
, 2008 In this demo we will present FOG, a system that mines frequent outerplanar graphs. We argue that outerplanar graphs are an interesting class as they can be mined efficiently and are practically relevant for chemical applications.
Jan Ramon
core
Location in maximal outerplanar graphs
In this work we study the metric dimension and the location-domination number of maximal outerplanar graphs. Concretely, we determine tight upper and lower bounds on the metric dimension and characterize those maximal outerplanar graphs attaining the ...
Hernando Martín, María del Carmen +6 more
core
On reconstructing maximal outerplanar graphs
Discrete Mathematics, 1974 Manvel has proved that a maximal outerplanar graph can be reconstructed from the collection of isomorphism types of subgraphs obtained by deleting vertices of the given graph. This paper sharpens Manvel's result by showing that if the graph is not a triangulation of a hexagon, then reconstruction can be accomplished using only those isomorphism types ...
openaire +1 more source
Subgraph isomorphism for biconnected outerplanar graphs in cubic time
, 1989 A dynamic programming algorithm for determining whether a biconnected outerplanar graph is isomorphic to a subgraph of another biconnected outerplanar graph is presented.
Lingas, Andrzej
core +1 more source
Approximate realizations for outerplanaric degree sequences
Journal of Computer and System SciencesWe study the question of whether a sequence d = (d_1,d_2, \ldots, d_n) of positive integers is the degree sequence of some outerplanar (a.k.a. 1-page book embeddable) graph G. If so, G is an outerplanar realization of d and d is an outerplanaric sequence.
Amotz Bar-Noy +4 more
openaire +4 more sources
Rainbow subgraphs in edge-colored planar and outerplanar graphs [PDF]
Discrete Mathematics Letters, 2023 Július Czap
doaj +1 more source
External Memory Algorithms for Outerplanar Graphs
, 1999 We present external memory algorithms for outerplanarity testing, embedding outerplanar graphs, breadth-first search (BFS) and depth-first search (DFS) in outerplanar graphs, and finding a2-separator of size 2 for a given outerplanar graph.
Norbert Zeh +3 more
core +1 more source