Results 121 to 130 of about 414,139 (194)
On the k-Structure Ratio in Planar and Outerplanar Graphs
Discrete Mathematics & Theoretical Computer Science, 2008 A planar k-restricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar k-restricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar k-
Gruia Calinescu, Cristina G. Fernandes
doaj
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
Horizontal visibility graph of a random restricted growth sequence. [PDF]
Adv Appl Math, 2021 Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source
Reconstruction of maximal outerplanar graphs
Discrete Mathematics, 1972 AbstractS. Ulam has conjectured that every graph with three or more points is uniquely determined by its collection of point-deleted subgraphs. This has been proved for various classes of graphs, but progress has generally been confined to very symmetrical graphs and graphs with connectivity zero or one.
openaire +3 more sources
Rainbow subgraphs in edge-colored planar and outerplanar graphs [PDF]
Discrete Mathematics Letters, 2023 Július Czap
doaj +1 more source
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
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
Clustering systems of phylogenetic networks. [PDF]
Theory Biosci, 2023 Hellmuth M, Schaller D, Stadler PF.
europepmc +1 more source
The Canadian Traveller Problem on outerplanar graphs
CoRRWe study the $k$-Canadian Traveller Problem, where a weighted graph $G=(V,E,ω)$ with a source $s\in V$ and a target $t\in V$ are given. This problem also has a hidden input $E_* \subsetneq E$ of cardinality at most $k$ representing blocked edges. The objective is to travel from $s$ to $t$ with the minimum distance.
Laurent Beaudou +7 more
openaire +6 more sources
Maximally Expressive GNNs for Outerplanar Graphs
We propose a linear time graph transformation that enables the Weisfeiler-Leman (WL) algorithm and message passing graph neural networks (MPNNs) to be maximally expressive on outerplanar graphs.
Gärtner, Thomas; orcid: +8 more
core +3 more sources