Results 41 to 50 of about 414,139 (194)
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 +4 more sources
Outerplanar Graph Drawings with Few Slopes [PDF]
Computational Geometry, 2012 Major revision of the whole ...
Kolja B. Knauer +2 more
openaire +10 more sources
On the number of series parallel and outerplanar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We show that the number $g_n$ of labelled series-parallel graphs on $n$ vertices is asymptotically $g_n \sim g \cdot n^{-5/2} \gamma^n n!$, where $\gamma$ and $g$ are explicit computable constants.
Manuel Bodirsky +3 more
doaj +1 more source
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 +4 more sources
I/O-Optimal Algorithms for Outerplanar Graphs
Journal of Graph Algorithms and Applications, 2004 We present linear-I/O algorithms for fundamental graph problems on embedded outerplanar graphs. We show that breadth-first search, depth-first search, single-source shortest paths, triangulation, and computing an ϵ-separator of size O(1/ϵ) take O(scan(N))
Anil Maheshwari, Norbert Zeh
doaj +1 more source
Connected Graph Searching in Outerplanar Graphs
Electronic Notes in Discrete Mathematics, 2005 Search games are a powerfull tool for studying various connectivity parameters of graphs. In the classical search game, we consider an undirected graph G = (V, E) whose edges are initially contaminated. A set of searchers try to clean the graph. At the beginning the graph contains no searchers.
Fedor V. Fomin +2 more
openaire +2 more sources
Structure and properties of maximal outerplanar graphs. [PDF]
, 2009 Outerplanar graphs are planar graphs that have a plane embedding in which each vertex lies on the boundary of the exterior region. An outerplanar graph is maximal outerplanar if the graph obtained by adding an edge is not outerplanar. Maximal outerplanar
Allgeier, Benjamin
core +1 more source
Strong Chromatic Index of Outerplanar Graphs
Axioms, 2022 The strong chromatic index χs′(G) of a graph G is the minimum number of colors needed in a proper edge-coloring so that every color class induces a matching in G. It was proved In 2013, that every outerplanar graph G with Δ≥3 has χs′(G)≤3Δ−3.
Ying Wang +3 more
doaj +1 more source
Metric Dimension of Maximal Outerplanar Graphs [PDF]
, 2021 In this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if β(G) denotes the metric dimension of a maximal outerplanar graph G of order n, we prove that 2≤β(G)≤⌈2n5⌉ and that the bounds are tight.
Hernando, C. +6 more
core +1 more source
On the colorings of outerplanar graphs
Discrete Mathematics, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source