Results 271 to 280 of about 22,754 (291)
Some of the next articles are maybe not open access.
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
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
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
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
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
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, 1990The 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
A new perspective on clustered planarity as a combinatorial embedding problem
Theoretical Computer Science, 2016Ignaz Rutter
exaly
Proceedings of the twenty-first annual symposium on Computational geometry, 2005
Pier Francesco Cortese +1 more
openaire +1 more source
Pier Francesco Cortese +1 more
openaire +1 more source
Parallel Algorithms in Graph Theory: Planarity Testing
SIAM Journal on Computing, 1982Janos Simon
exaly