Results 91 to 100 of about 886,125 (210)
Journal of Computational Geometry, 2016 We define strict confluent drawing, a form of confluent drawing in which the existence of an edge is indicated by the presence of a smooth path through a system of arcs and junctions (without crossings), and in which such a path, if it exists, must be ...
David Eppstein +5 more
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
Discrete Mathematics & Theoretical Computer ScienceNot every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyond planarity by considering upward $k$-planar drawings of DAGs in which the
Patrizio Angelini +10 more
doaj +1 more source
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. [PDF]
Algorithmica, 2022 Golovach PA, Zehavi M.
europepmc +1 more source
The outerplanar crossing number of the complete bipartite graph
Discrete Applied Mathematics, 2022 B. Ábrego, S. Fernández-Merchant
semanticscholar +1 more source
Definability Equals Recognizability for $k$-Outerplanar Graphs
, 2015 40 pages, 8 ...
Jaffke, Lars, Bodlaender, Hans L.
openaire +7 more sources
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
Non-Preemptive Tree Packing. [PDF]
Algorithmica, 2023 Lendl S, Woeginger G, Wulf L.
europepmc +1 more source
One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons [PDF]
, 2021 Patrizio Angelini +4 more
openalex +1 more source
Counting Rules for Computing the Number of Independent Sets of a Grid Graph
MathematicsThe issue of counting independent sets of a graph, G, represented as i(G), is a significant challenge within combinatorial mathematics. This problem finds practical applications across various fields, including mathematics, computer science, physics, and
Guillermo De Ita Luna +2 more
semanticscholar +1 more source