Results 31 to 40 of about 414,139 (194)
Genus Distributions of Cubic Outerplanar Graphs
Journal of Graph Algorithms and Applications, 2011 We present a quadratic-time algorithm for computing the genus distribution of any 3-regular outerplanar graph. Although recursions and some formulas for genus distributions have previously been calculated for bouquets and for various kinds of ladders ...
Jonathan Gross
doaj +1 more source
Maximally Expressive GNNs for Outerplanar Graphs [PDF]
, 2023 We propose a linear time graph transformation that enables the Weisfeiler-Leman (WL) test and message passing graph neural networks (MPNNs) to be maximally expressive on outerplanar graphs.
Gärtner, Thomas; orcid: +8 more
core +3 more sources
Directed Acyclic Outerplanar Graphs Have Constant Stack Number [PDF]
TheoretiCSThe stack number of a directed acyclic graph $G$ is the minimum $k$ for which there is a topological ordering of $G$ and a $k$-coloring of the edges such that no two edges of the same color cross, i.e., have alternating endpoints along the topological ...
Paul Jungeblut +2 more
doaj +1 more source
Choosability with separation of cycles and outerplanar graphs
Discussiones Mathematicae Graph Theory, 2023 We consider the following list coloring with separation problem of graphs: Given a graph $G$ and integers $a,b$, find the largest integer $c$ such that for any list assignment $L$ of $G$ with $|L(v)|\le a$ for any vertex $v$ and $|L(u)\cap L(v)|\le c$ for any edge $uv$ of $G$, there exists an assignment $φ$ of sets of integers to the vertices of $G ...
Jean-Christophe Godin, Oliver Togni
doaj +4 more sources
On the Edge-Length Ratio of Outerplanar Graphs [PDF]
Theoretical Computer Science, 2018 We show that any outerplanar graph admits a planar straightline drawing such that the length ratio of the longest to the shortest edges is strictly less than 2. This result is tight in the sense that for any $ε> 0$ there are outerplanar graphs that cannot be drawn with an edge-length ratio smaller than $2 - ε$.
Lazard, Sylvain +2 more
openaire +8 more sources
Algorithms, 2013 The maximum common connected edge subgraph problem is to find a connected graph with the maximum number of edges that is isomorphic to a subgraph of each of the two input graphs, where it has applications in pattern recognition and chemistry.
Takeyuki Tamura, Tatsuya Akutsu
doaj +1 more source
Entire choosability of near-outerplane graphs [PDF]
, 2008 It is proved that if G is a plane embedding of a K4-minor-free graph with maximum degree Δ, then G is entirely 7-choosable if Δ≤4 and G is entirely (Δ+ 2)-choosable if Δ≥ 5; that is, if every vertex, edge and face of G is given a list of max{7,Δ+2 ...
Timothy J. Hetherington +2 more
core +1 more source
The Planar Index and Outerplanar Index of Some Graphs Associated to Commutative Rings
Discussiones Mathematicae - General Algebra and Applications, 2019 In this paper, we study the planar and outerplanar indices of some graphs associated to a commutative ring. We give a full characterization of these graphs with respect to their planar and outerplanar indices when R is a finite ring.
Barati Zahra, Afkhami Mojgan
doaj +1 more source
Drawing Outer 1-planar Graphs with Few Slopes
Journal of Graph Algorithms and Applications, 2015 A graph is outer 1-planar if it admits a drawing where each vertex is on the outer face and each edge is crossed by at most another edge. Outer 1-planar graphs are a superclass of the outerplanar graphs and a subclass of the planar partial 3-trees.
Emilio Di Giacomo +2 more
doaj +1 more source
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
Journal of Graph Algorithms and Applications, 2014 We present a linear time algorithm for computing an implicit linear space representation of a minimum cycle basis in weighted partial 2-trees (i.e., graphs of treewidth at most two) with non-negative edge-weights. The implicit representation can be made
Carola Doerr +2 more
doaj +1 more source