Results 121 to 130 of about 22,754 (291)
The design of intrinsically robust stretchable semiconducting polymers was achieved through OTBS‐mediated post‐functionalization of PDPP2T side chains with UPy units, generating dual hydrogen‐bonding motifs comprising weaker urethane linkages and strong quadruple UPy interactions along the long alkyl side chain, which is crucial for achieving desirable
Dinda Bazliah +7 more
wiley +1 more source
Planarity and edge poset dimension [PDF]
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 +2 more
core +1 more source
Min-$k$-planar Drawings of Graphs
The study of nonplanar drawings of graphs with restricted crossing configurations is a well-established topic in graph drawing, often referred to as beyond-planar graph drawing.
Carla Binucci +9 more
doaj +1 more source
Halogen Bonding in (Z)-2-Iodocinnamaldehyde
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 +3 more
doaj +1 more source
Sodium alginate regulates interfacial ion transport and retention in electrolyte‐gated synaptic transistors. The carboxylate‐rich polymeric network forms a dynamic interfacial ion‐diffusion barrier that facilitates ion injection during programming while suppressing ion back‐diffusion, thereby stabilizing the electrochemically doped channel state.
Chaeyeon Han +6 more
wiley +1 more source
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 +4 more
doaj +1 more source
On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
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
A new class of photoresponsive liquid‐crystalline (LC) adhesives based on biomineral‐inspired organic/inorganic colloidal hybrids is reported. These colloidal LC materials are formed by hybridization of a hydroxyapatite nanorod with azobenzene‐based forklike molecules.
Junya Uchida +4 more
wiley +1 more source
A systematic review is conducted to assess the influence of electrode architecture across micro‐ to mesoscopic length scales on electron‐transfer pathways in electrocatalysis. We discuss the structure‐activity relationships in electrocatalytic applications, including resource recovery and environmental remediation, and provide cost‐effective, efficient
Manshu Zhao +6 more
wiley +1 more source
OOPS: Optimized One-Planarity Solver via SAT
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

