Results 41 to 50 of about 1,056 (209)
Outerplanar Graphs and Delaunay Triangulations [PDF]
, 2012 Dillencourt [1] showed that all maximal outerplanar graphs can be realized as Delaunay triangulations of points in convex position. In this note, we give two new, alternate proofs.
Alam, Ashraful +2 more
openaire +2 more sources
Adjacency posets of outerplanar graphs [PDF]
Discrete Mathematics, 2021 Felsner, Li and Trotter showed that the dimension of the adjacency poset of an outerplanar graph is at most 5, and gave an example of an outerplanar graph whose adjacency poset has dimension 4. We improve their upper bound to 4, which is then best possible.
openaire +3 more sources
Vietnam Journal of Computer Science, 2018 We propose aggregative context-aware fitness functions based on feature selection for evolutionary learning of characteristic graph patterns. The proposed fitness functions estimate the fitness of a set of correlated individuals rather than the sum of ...
Fumiya Tokuhara +4 more
doaj +1 more source
Scaling Limits of Random Graphs from Subcritical Classes: Extended abstract [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 We study the uniform random graph $\mathsf{C}_n$ with $n$ vertices drawn from a subcritical class of connected graphs. Our main result is that the rescaled graph $\mathsf{C}_n / \sqrt{n}$ converges to the Brownian Continuum Random Tree $\mathcal{T}_ ...
Konstantinos Panagiotou +2 more
doaj +1 more source
On Another Class of Strongly Perfect Graphs
Mathematics, 2022 For a commutative ring R with unity, the associate ring graph, denoted by AG(R), is a simple graph with vertices as nonzero elements of R and two distinct vertices are adjacent if they are associates.
Neha Kansal +3 more
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
An O(mn2) Algorithm for Computing the Strong Geodetic Number in Outerplanar Graphs
Discussiones Mathematicae Graph Theory, 2022 Let G = (V (G), E(G)) be a graph and S be a subset of vertices of G. Let us denote by γ[u, v] a geodesic between u and v. Let Γ(S) = {γ[vi, vj] | vi, vj ∈ S} be a set of exactly |S|(|S|−1)/2 geodesics, one for each pair of distinct vertices in S.
Mezzini Mauro
doaj +1 more source
Simultaneous coloring of vertices and incidences of outerplanar graphs
Electronic Journal of Graph Theory and Applications, 2023 A vi-simultaneous proper k-coloring of a graph G is a coloring of all vertices and incidences of the graph in which any two adjacent or incident elements in the set V(G)∪I(G) receive distinct colors, where I(G) is the set of incidences of G.
Mahsa Mozafari-Nia, Moharram N. Iradmusa
doaj +1 more source
Characterizations of outerplanar graphs
Discrete Mathematics, 1979 AbstractThe paper presents several characterizations of outerplanar graphs, some of them are counterparts of the well-known characterizations of planar graphs and the other provide very efficient tools for outerplanarity testing, coding (i.e. isomorphism testing), and counting such graphs.
openaire +1 more source
Entire choosability of near-outerplane graphs
, 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