Results 101 to 110 of about 22,687 (289)
Biomass Native Structure Into Functional Carbon‐Based Catalysts for Fenton‐Like Reactions
This study indicates that eight biomasses with 2D flaky and 1D acicular structures influence surface O types, morphology, defects, N doping, sp2 C, and Co nanoparticles loading in three series of carbon, N‐doped carbon, and cobalt/graphitic carbon. This work identifies how these structural factors impact catalytic pathways, enhancing selective electron
Wenjie Tian +7 more
wiley +1 more source
Shellac, a centuries‐old natural resin, is reimagined as a green material for flexible electronics. When combined with silver nanowires, shellac films deliver transparency, conductivity, and stability against humidity. These results position shellac as a sustainable alternative to synthetic polymers for transparent conductors in next‐generation ...
Rahaf Nafez Hussein +4 more
wiley +1 more source
Ranking and Unranking of the Planar Embeddings of a Planar Graph
Let $\mathcal{G}$ be the set of all the planar embeddings of a (not necessarily connected) $n$-vertex graph $G$. We present a bijection $Φ$ from $\mathcal{G}$ to the natural numbers in the interval $[0 \dots |\mathcal{G}| - 1]$. Given a planar embedding $\mathcal{E}$ of $G$, we show that $Φ(\mathcal{E})$ can be decomposed into a sequence of $O(n ...
Giuseppe Di Battista +3 more
openaire +3 more sources
DNA strands are employed both as dynamic linkers and nanoscale templates for the integration of Ag2S nanoparticles on MoS2, which in turn imparted photothermal responsiveness; this feature permits the selective cargo (fluorophore, quantum dots or an enzyme) release from the MoS2 surface in response to local heat induced by light irradiation.
Kai Chen +3 more
wiley +1 more source
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
Let C be a clustered graph and suppose that the planar embedding of its underlying graph is fixed. Is testing the c-planarity of C easier than in the variable embedding setting?
Giuseppe Di Battista, Fabrizio Frati
doaj +1 more source
Control of Polarization and Polar Helicity in BiFeO3 by Epitaxial Strain and Interfacial Chemistry
In BiFeO3 thin films, the interplay of interfacial chemistry, electrostatics, and epitaxial strain is engineered to stabilize homohelicity in polarization textures at the domain scale. The synergistic use of a Bi2O2‐terminated Aurivillius buffer layer and a highly anisotropic compressive epitaxial strain offers new routes to control the polar‐texture ...
Elzbieta Gradauskaite +5 more
wiley +1 more source
The Complexity of Planarity Testing [PDF]
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely conjectured that L = SL [Sak96]. The upper bound of SL matches the lower
Allender, Eric +3 more
core +1 more source
ABSTRACT Chitosan, a polysaccharide upcycled from biowaste, has long promised sustainable, biocompatible, and antimicrobial films and devices, an appeal reinforced by its recent regulatory recognition, with several chitosan‐based antibacterial dressings gaining clearance through the Food and Drug Administration's 510(k) pathway.
Jacopo Nicoletti +16 more
wiley +1 more source
Incremental Convex Planarity Testing [PDF]
An important class of planar straight-line drawings of graphs are convex drawings, in which all the faces are drawn as convex polygons. A planar graph is said to be convex planar if it admits a convex drawing. We give a new combinatorial characterization
Vismara, Luca +2 more
core +1 more source
Building Blocks of Upward Planar Digraphs
The upward planarity testing problem consists of testing if a digraph admits a drawing Γ such that all edges in Γ are monotonically increasing in the vertical direction and no edges in Γ cross.
Patrick Healy, Karol Lynch
doaj +1 more source

