Results 41 to 50 of about 1,769 (162)
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
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
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
Point deletions of outerplanar blocks [PDF]
, 1976 Let G be a graph. If v is a vertex of G then the (− 1, v)-subgraphs of G are defined to be the point deletions of G, except for G ∼ {v}, with v labeled on each. This paper first classifies all outerplanar blocks which have a pair of v-isomorphic (− 1, v)-
Giles, William B
core +1 more source
Outerplanar Obstructions for Matroid Pathwidth
Electronic Notes in Discrete Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Koutsonas, Athanassios +2 more
openaire +5 more sources
Fuzzy Outerplanar Graphs and Its Applications
International Journal of Computational Intelligence SystemsThe concept of a crisp graph is essential in the study of outerplanar graphs because outerplanar graphs are a unique type of planar graphs containing special characteristics. One of the core concepts of crisp graphs, the notion of a subgraph, is utilized
Deivanai Jaisankar +3 more
doaj +1 more source
On the Threshold for Triangulations Inside Convex Polygons
Random Structures &Algorithms, Volume 69, Issue 2, September 2026.ABSTRACT Start with a large convex polygon and add all other edges inside independently with probability p$$ p $$. At what critical threshold pc$$ {p}_c $$ do triangulations of the polygon begin to appear? The first author and Gravner asked this question and observed that pc=Θ(1)$$ {p}_c=\Theta (1) $$, using the relationship with the Catalan numbers ...
Brett Kolesnik +2 more
wiley +1 more source
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
Bipolar fuzzy outerplanar graphs approach in image shrinking
Scientific ReportsBipolar fuzzy outerplanar graphs are interesting and significant subclasses within the broader field of fuzzy graph theory. In this paper, bipolar fuzzy outerplanar graphs, and its properties are introduced.
Deivanai Jaisankar +3 more
doaj +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