Results 261 to 270 of about 22,383 (289)
Some of the next articles are maybe not open access.

Planar Lattices

Canadian Journal of Mathematics, 1975
A finite partially ordered set (poset) P is customarily represented by drawing a small circle for each point, with a lower than b whenever a < b in P, and drawing a straight line segment from a to b whenever a is covered by b in P (see, for example, G. Birkhoff [2, p. 4]). A poset P is planar if such a diagram can be drawn for P in which none of the
Kelly, David, Rival, Ivan
openaire   +2 more sources

On planarity and similarity restraints

open access: yesJournal of Applied Crystallography, 2001
Planarity and similarity restraints are described using a unified framework for the computation layout. In both cases, the gradient and Hessian of the restraint residual with respect to atomic coordinates are derived.
Blanc, E., Paciorek, W.
exaly   +2 more sources

Planar Rings

Results in Mathematics, 1996
All rings that are planar near-rings are characterized and constructed. For each vector space over a nontrivial division ring there is precisely one isomorphism class of such rings.
openaire   +2 more sources

ACHIRALITY AND PLANARITY

Communications in Contemporary Mathematics, 2000
An embedding of a space Y into the 3-sphere S 3 is said to be strictly achiral if its image is pointwise fixed by an orientation reversing homeomorphism of S 3 . A space Y is said to be abstractly planar if it can be embedded into the 2-sphere S
Jiang, Boju, Wang, Shicheng
openaire   +1 more source

Planar electrochromatography

Journal of Chromatography A, 2004
Recent developments in planar electrochromatography (PEC) in both the normal-phase and the reversed-phase modes, and at both atmospheric and elevated pressure, are reviewed. Other forced-flow techniques in planar chromatography are also briefly covered.
openaire   +2 more sources

On boolean characterizations of planarity and planar embeddings of graphs

Annals of Operations Research, 1990
The author introduces a new planarity characterization for graphs, involving the solution of a quadratic Boolean equation. He then discusses seven combinatorially distinct configurations, called planarity obstacles, which lead to a graph whose order and size are linear functions of those of the original graph. Testing for planarity and finding a planar
openaire   +2 more sources

Simple, reliable, and universal metrics of molecular planarity

Journal of Molecular Modeling, 2021
Tian Lu
exaly  

Quantifying Planarity in the Design of Organic Electronic Materials

Angewandte Chemie - International Edition, 2021
Yuxuan Che, Dmytro Perepichka
exaly  

A Survey on Graph Drawing Beyond Planarity

ACM Computing Surveys, 2020
Fabrizio Montecchiani   +2 more
exaly  

Atomic Embeddability, Clustered Planarity, and Thickenability

Journal of the ACM, 2022
Radoslav Fulek, Csaba Tóth
exaly  

Home - About - Disclaimer - Privacy