Results 121 to 130 of about 975,712 (248)
Computational Geometry, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Prosenjit Bose, Ferran Hurtado
openaire +2 more sources
Endosomal Escape of siRNA Polyplexes: A Molecular Dynamics Perspective on Underlying Mechanisms
Advanced Functional Materials, EarlyView.Molecular dynamics simulations reveal distinct endosomal escape mechanisms of siRNA nanoparticles, ranging from electrostatic membrane attachment to hydrophobic membrane fusion. Hydrophobic residues and anionic endosomal lipids emerge as key determinants of membrane disruption, linking molecular interactions to experimental delivery performance and ...
Katharina M. Steinegger +5 more
wiley +1 more source
On the Synthesis of Planar Graphs with Given Properties
Кібернетика та комп'ютерні технологіїThe problem of studying the structural properties of planar subgraphs G\v, where v is an arbitrary vertex of a graph G of undirected genus, is considered, using cell chains that connect limit cycles with points of a given set M of the graph G\v.
Volodymyr Petrenjuk, Dmytro Petreniuk
doaj +1 more source
Advanced Functional Materials, EarlyView.Neuromorphic plasticity in OECTs is governed by the post‐stimulus evolution of coupled ionic and electronic states. Semiconductor chemistry and morphology, electrolyte composition and interfaces, and device architecture regulate ion injection, transport, confinement, and release, shifting responses from rapidly relaxing STP to metastable memory and ...
Inho Lee +9 more
wiley +1 more source
Journal of Graph Algorithms and Applications, 2017 We introduce a new type of graph drawing called "rook-drawing". A rook-drawing of a graph $G$ is obtained by placing the $n$ nodes of $G$ on the intersections of a regular grid, such that each row and column of the grid supports exactly one node.
David Auber +3 more
doaj +1 more source
Graph minors. V. Excluding a planar graph
, 1986 We prove that for every planar graph H there is a number w such that every graph with no minor isomorphic to H can be constructed from graphs with at most w vertices, by piecing them together in a tree structure.
Seymour, P.D, Robertson, Neil
core +1 more source
Molecular Bridges for 2D Nanomaterials
Advanced Functional Materials, EarlyView.Molecular cross‐linking provides a versatile strategy to engineer interfaces in 2D materials. By tuning the linker backbone, binding mode, and interflake spacing, molecular bridges can regulate charge transport, mechanical integrity, chemical functionality, and processing.
Yudhajit Bhattacharjee +3 more
wiley +1 more source
Discrete Mathematics, 1974 AbstractA 3-valent graph G is cyclically n-connected provided one must cut at least n edges in order to separate any two circuits of G. If G is cyclically n-connected but any separation of G by cutting n edges yields a component consisting of a simple circuit, then we say that G is strongly cyclically n-connected.
openaire +2 more sources
Advanced Functional Materials, EarlyView.Bioinspired Bouligand architectures are translated into biodegradable polymer laminates with integrated sensing, revealing how structural design governs multifunctional performance. A 20° interlayer rotation optimizes strength, flexibility, and electromechanical response, while embedded nanotube networks enable real‐time damage detection and wearable ...
Piotr K. Szewczyk +4 more
wiley +1 more source
DP-4-Colorability on Planar Graphs Excluding 7-Cycles Adjacent to 4- or 5-Cycles
MathematicsIn order to resolve Borodin’s Conjecture, DP-coloring was introduced in 2017 to extend the concept of list coloring. In previous works, it is proved that every planar graph without 7-cycles and butterflies is DP-4-colorable.
Fan Yang, Xiangwen Li, Ziwen Huang
doaj +1 more source