Results 101 to 110 of about 30,716 (267)

Guanosine‐Quadruplex Hydrogels as Dynamic, Mechanically Tunable and Ion Conductive 3D Scaffolds for Cell Culture Applications

open access: yesAdvanced Functional Materials, EarlyView.
Versatile guanosine‐quadruplex (GQ) hydrogels are developed as dynamic biomatrices for cell culture. These scaffolds are fabricated under mild aqueous conditions, present improved stability, tunable mechanical properties within physiological ranges; fibrillar, porous microstructure, ion conductivity, and cytocompatibility.
Neha Thakur   +10 more
wiley   +1 more source

Pathwidth of 2-Layer k-Planar Graphs

open access: yesComputing in Geometry and Topology
A bipartite graph G = (X ∪ Y, E) is a 2-layer k-planar graph if it admits a drawing on the plane such that the vertices in X and Y are placed on two parallel lines respectively, edges are drawn as straight-line segments, and every edge involves at most ...
Yuto Okada
doaj   +1 more source

GeS as an Emerging OTS Material: Atomic Structure and Modeling of ON/OFF Switching

open access: yesAdvanced Functional Materials, EarlyView.
The structural puzzle of glassy GeS, an advanced memory‐selector material, has finally been disentangled, revealing a patchwork of mixed tetrahedral and trigonal species. Under a high electric field, over‐ and under‐coordinated Ge and S defects, together with three‐membered rings, form an interconnected network associated with localized and extended ...
Andrey Tverjanovich   +13 more
wiley   +1 more source

Planar domination graphs

open access: yesDiscrete Mathematics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Elaine M. Eschen   +2 more
openaire   +1 more source

On the Synthesis of Planar Graphs with Given Properties

open access: yesКібернетика та комп'ютерні технології
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

Configuration‐Encoded Cell Alignment by Light‐Gated Silicon Photovoltaic Microcell Arrays

open access: yesAdvanced Functional Materials, EarlyView.
Light‐gated silicon photovoltaic microcells convert pulsed illumination into localized electrical cues. Arranging otherwise similar microcells into four‐lobed, six‐lobed, or circular patterns directs fibroblasts into corresponding local arrangements without wired stimulation.
Yifan Tao   +7 more
wiley   +1 more source

Gerrymandering Planar Graphs

open access: yesInternational Joint Conference on Autonomous Agents and Multiagent Systems
We study the computational complexity of the map redistricting problem (gerrymandering). Mathematically, the electoral district designer (gerrymanderer) attempts to partition a weighted graph into k connected components (districts) such that its candidate (party) wins as many districts as possible. Prior work has principally concerned the special cases
Dippel, J.   +4 more
openaire   +5 more sources

Rook-drawings of Plane Graphs

open access: yesJournal 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

A Miniaturized Autonomous Thermomagnetic Generator

open access: yesAdvanced Functional Materials, EarlyView.
Micro, autonomous and high power thermomagnetic generator operating between a heat dissipator and a processor. ABSTRACT Thermomagnetic generators (TMG) are promising devices for converting low‐grade waste heat into electricity. Self‐actuation using permanent magnets is the key to autonomy.
Morgan Almanza   +11 more
wiley   +1 more source

1-Planarity of Graphs with a Rotation System

open access: yesJournal of Graph Algorithms and Applications, 2015
A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. 1-planarity is known NP-hard, even for graphs of bounded bandwidth, pathwidth, or treewidth, and for near-planar graphs in which an edge is added to a planar
Christopher Auer   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy