Results 11 to 20 of about 30,007,210 (289)
OOPS: Optimized One-Planarity Solver via SAT
Journal of Graph Algorithms and ApplicationsWe present OOPS (Optimized One-Planarity Solver), a practical heuristic for recognizing 1-planar graphs and several important subclasses. A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once---a natural ...
Sergey Pupyrev
doaj +2 more sources
Two Simple and Reliable Metrics of Molecular Planarity: Molecular Planarity Parameter (MPP) and Span of Deviation from Plane (SDP) [PDF]
, 2021 Planarity is a very important structural character of molecules, which is closely related to many molecular properties. However, there is currently no simple, universal, and robust way to measure molecular planarity. In order to fill this evident gap, we
Tian, Lu
core +1 more source
, 2021 In this paper, we introduce and study multilevel planarity, a generalization of upward planarity and level planarity. Let $G = (V, E)$ be a directed graph and let $\ell: V \to \mathcal P(\mathbb Z)$ be a function that assigns a finite set of integers to ...
Barth, Lukas +3 more
core +1 more source
N-(4-Hydroxy-2-nitrophenyl)acetamide
IUCrData, 2022 The title compound, C8H8N2O4, differs in its degree of planarity from the 3-nitro isomer and also in its hydrogen-bonding pattern. Its NH group forms an intramolecular hydrogen bond to a nitro oxygen atom, and its OH group forms an intermolecular ...
James E. Hines III +3 more
doaj +1 more source
A GRAPH ASSOCIATED TO FILTERS OF A LATTICE [PDF]
Journal of Algebraic Systems, 2023 Let $L$ be a lattice with the least element $0$ and the greatest element $1$. In this paper, we associate a graph to filters of $L$, in which the vertex set is being the set of all non-trivial filters of $L$, and two distinct vertices $F$ and $E$ are ...
Sh. Ebrahimi Atani +3 more
doaj +1 more source
Synchronized Planarity with Applications to Constrained Planarity Problems [PDF]
, 2021 We introduce the problem Synchronized Planarity. Roughly speaking, its input is a loop-free multi-graph together with synchronization constraints that, e.g., match pairs of vertices of equal degree by providing a bijection between their edges ...
Fink, Simon D. +2 more
core +1 more source
On edge colorings of 1-planar graphs [PDF]
Information Processing Letters, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xin Zhang 0017, Jianliang Wu 0001
openaire +1 more source
Journal of Biological Engineering, 2020 Background In current cancer spheroid culturing methods, the transfer and histological processing of specimens grown in 96-well plates is a time consuming process.
Warren Weisler +4 more
doaj +1 more source
The Stub Resolution of 1-Planar Graphs
Journal of Graph Algorithms and Applications, 2020 The resolution of a drawing plays a crucial role when defining criteria for its quality. In the past, grid resolution, edge-length resolution, angular resolution and crossing resolution have been investigated. In this paper, we investigate the stub resolution, a recently introduced criterion for nonplanar drawings. Intersection points divide edges into
Michael Kaufmann 0001 +5 more
openaire +5 more sources
Counting cliques in 1-planar graphs
European Journal of Combinatorics, 2023 The problem of maximising the number of cliques among n-vertex graphs from various graph classes has received considerable attention. We investigate this problem for the class of 1-planar graphs where we determine precisely the maximum total number of cliques as well as the maximum number of cliques of any fixed size. We also precisely characterise the
Jochen Pascal Gollin +4 more
openaire +6 more sources