Results 121 to 130 of about 1,769 (162)
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
On the Structure of Locally Outerplanar Graphs
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2015 Hung-Lung Wang +2 more
openaire +1 more source
The Tutte polynomial characterizes simple outerplanar graphs
We show that if G is a simple outerplanar graph and H is a graph with the same Tutte polynomial as G, then H is also outerplanar.
Noble, S. +3 more
core
Outer connected domination in maximal outerplanar graphs and beyond
Discussiones Mathematicae Graph TheoryWei Yang, Baoyindureng Wu
doaj +1 more source
Outerplanar graph drawings with few slopes [PDF]
Computational Geometry: Theory and Applications, 2014 International audienceWe consider straight-line outerplanar drawings of outerplanar graphs in which a small number of distinct edge slopes are used, that is, the segments representing edges are parallel to a small number of directions.
Piotr Micek +2 more
exaly +13 more sources
Generalized outerplanar Turán number of short paths [PDF]
Discrete Mathematics, 2023 Let H be a graph. The generalized outerplanar Turán number of H, denoted by fOP(n,H), is the maximum number of copies of H in an n-vertex outerplanar graph. Let Pk denote a path on k vertices.
Ervin Gyori +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Linear algorithms to recognize outerplanar and maximal outerplanar graphs
Information Processing Letters, 1979exaly +4 more sources
Graphs and Combinatorics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grant Cairns, Yury Nikolayevsky
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grant Cairns, Yury Nikolayevsky
openaire +2 more sources
Edge covering pseudo-outerplanar graphs with forests [PDF]
Discrete Mathematics, 2012 A graph is pseudo-outerplanar if each block has an embedding on the plane in such a way that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another.
Xin Zhang, Jian-Liang Wu
exaly +2 more sources
Journal of Algorithms, 1996
Summary: We show that for outerplanar graphs \(G\) the problem of augmenting \(G\) by adding a minimum number of edges such that the augmented graph \(G'\) is planar and bridge-connected, biconnected, or triconnected can be solved in linear time and space.
openaire +4 more sources
Summary: We show that for outerplanar graphs \(G\) the problem of augmenting \(G\) by adding a minimum number of edges such that the augmented graph \(G'\) is planar and bridge-connected, biconnected, or triconnected can be solved in linear time and space.
openaire +4 more sources