Results 121 to 130 of about 22,687 (289)

Planarity and edge poset dimension [PDF]

, 1996
Different areas of discrete mathematics lead to intrinsically different characterizations of planar graphs. Planarity is expressed in terms of topology, combinatorics, algebra or search trees.
Ossona de Mendez, Patrice, De Fraysseix, Hubert, de Mendez, Patrice Ossona   +2 more
core   +1 more source

Beyond Outerplanarity

Computing in Geometry and Topology
We study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., convex drawings. We consider two families of graph classes with convex drawings: outer $k$-planar graphs, where each edge is crossed by at ...
Steven Chaplick, Myroslav Kryven, Giuseppe Liotta, Andre Löffler, Alexander Wolff   +4 more
doaj   +1 more source

Halogen Bonding in (Z)-2-Iodocinnamaldehyde

Molecules, 2013
Based on the bulkiness of the iodine atom, a non-planar conformation was expected for the title compound. Instead, its molecular structure is planar, as experimentally determined using single crystal X-ray diffraction, and confirmed theoretically by DFT ...
Miriam Rossi, Pakorn Bovonsombat, Francesco Caruso, Andrew Jdaydani   +3 more
doaj   +1 more source

Support‐Controlled Reaction Pathways via Dynamic Sulfur‐Mediated Interfaces for Selective Urea Electrolysis

Advanced Functional Materials, EarlyView.
Sulfur‐doped graphitized carbon nanofibers act as adaptive catalyst–support platforms, enabling dynamic sulfur‐mediated reconstruction and strong metal–support interactions. This unique behavior enhances catalyst stability and controls reaction pathways, achieving highly selective urea oxidation (∼92% N2) coupled with efficient hydrogen evolution ...
Melanie Guillén‐Soler, Lucía Vizcaíno‐Anaya, Ahmad Tayyebi, José Manuel Vila‐Fungueiriño, María del Carmen Giménez‐López   +4 more
wiley   +1 more source

Digital planarity—A review

Discrete Applied Mathematics, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Valentin E. Brimkov, David Coeurjolly, Reinhard Klette   +2 more
openaire   +1 more source

OOPS: Optimized One-Planarity Solver via SAT

Journal of Graph Algorithms and Applications
We 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   +1 more source

On the Cutting Edge: Simplified O(n) Planarity by Edge Addition

Journal of Graph Algorithms and Applications, 2004
We present new O(n)-time methods for planar embedding and Kuratowski subgraph isolation that were inspired by the Booth-Lueker PQ-tree implementation of the Lempel-Even-Cederbaum vertex addition method.
John Boyer, Wendy Myrvold
doaj   +1 more source

Embedded Ferroelectric Nanoclusters Can Drive Polarization Reversal in a Non‐Ferroelectric Polar Film via the Proximity Effect

Advanced Functional Materials, EarlyView.
Ferroelectric nanoclusters create local internal fields in a normally non‐switchable polar film because of polarization mismatch at their interfaces. That field opposes polarization in the regions with larger polarization and reinforces polarization in the regions with smaller polarization.
Anna N. Morozovska, Eugene A. Eliseev, Sergei V. Kalinin, Long‐Qing Chen, Dean R. Evans, Venkatraman Gopalan   +5 more
wiley   +1 more source

Biodegradable and Biocompatible Functional Polymers for Biomedical Applications

Advanced Functional Materials, EarlyView.
Biodegradable and biocompatible functional polymers integrate electrical, mechanical, and stimuli‐responsive functionalities while enabling programmed degradation under physiological conditions. This review introduces recent advances in conductive, shape‐memory, self‐healing, photocurable, and adhesive polymer systems, emphasizing material design ...
Won Bae Han, Shuvra Mondal, Sungkeun Han, Chan‐Hwi Eom, Venkata Ramesh Naganaboina, Suk‐Won Hwang   +5 more
wiley   +1 more source

Structural Parameterizations of $k$-Planarity

Journal of Graph Algorithms and Applications
The concept of $k$-planarity is extensively studied in the context of Beyond Planarity. A graph is $k$-planar if it admits a drawing in the plane in which each edge is crossed at most $k$ times.
Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada   +2 more
doaj   +1 more source