Results 61 to 70 of about 842,964 (161)
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
Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs [PDF]
Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph $T(G)$ has the triangles of the graph $G$ as its vertices,
Laskar, R.C., Mulder, H.M., Novick, B.
core +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
Nilpotent graphs with crosscap at most two
AKCE International Journal of Graphs and Combinatorics, 2018 Let R be a commutative ring with identity. The nilpotent graph of R, denoted by Γ N ( R ) , is a graph with vertex set Z N ( R ) ∗ , and two vertices x and y are adjacent if and only if x y is nilpotent, where Z N ( R ) = { x ∈ R : x y is nilpotent, for ...
A. Mallika, R. Kala
doaj
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. [PDF]
Algorithmica, 2022 Golovach PA, Zehavi M.
europepmc +1 more source
Non-Preemptive Tree Packing. [PDF]
Algorithmica, 2023 Lendl S, Woeginger G, Wulf L.
europepmc +1 more source
Discussiones Mathematicae Graph Theory, 2013 A path-neighborhood graph is a connected graph in which every neighborhood induces a path. In the main results the 3-sun-free path-neighborhood graphs are characterized.
Laskar R.C., Mulder Henry Martyn
doaj +1 more source
Mitochondrial networks through the lens of mathematics. [PDF]
Phys Biol, 2023 Lewis GR, Marshall WF.
europepmc +1 more source
Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs [PDF]
, 1979 S. Mitchell, Terry Beyer, Whitney Jones
openalex +1 more source
On the k-Structure Ratio in Planar and Outerplanar Graphs
Discrete Mathematics & Theoretical Computer Science, 2008 A planar k-restricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar k-restricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar k-
Gruia Calinescu, Cristina G. Fernandes
doaj