Results 121 to 130 of about 713,494 (298)
Extensions and variations of the two-person game on graphs [PDF]
Khachatryan A. Extensions and variations of the two-person game on graphs.
Khachatryan, Anush
core
Graph Sketcher: extending illustration to quantitative graphs
Scientists, engineers, and educators commonly need to make graphs that quickly illustrate quantitative ideas yet are not based on specific data sets. We call these graphs quantitative concept diagrams (QCDs).
Stewart, Robin +3 more
core +1 more source
Cell therapies typically rely on cold‐chain logistics and cryopreservation, limiting access and compromising cell quality. Here, a dual‐chamber device separates an oxygen‐supplying chamber from a hyaluronic acid cargo chamber, sustaining oxygen delivery for over 70 h and enabling ambient‐temperature shipment.
Daniel A. Domingo‐Lopez +9 more
wiley +1 more source
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
Embeddability of graphs into the Klein surface [PDF]
Flötotto A. Embeddability of graphs into the Klein surface.
Flötotto, Anna
core
Advanced ink systems for solution‐processed textile triboelectric nanogenerators are systematically summarized, spanning conductive, tribo‐negative, and tribo‐positive layers. By connecting ink chemistry, deposition methods, and device function, the present review reveals the key governing principles of solution development and highlights practical ...
Xinlong Sun, Stephen Beeby
wiley +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
On An Extremal Problem In The Class Of Bipartite 1-Planar Graphs
A graph G = (V, E) is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite 1-planar graphs with prescribed numbers of vertices in partite sets.
Czap Július +2 more
doaj +1 more source
Covalent Functionalization of 2D Semiconductors: A Roadmap to Advanced Electronic Devices
This Review presents recent advances in the covalent functionalization strategies for two‐dimensional semiconductors and their implementation in modern technologies. Layered materials are modified through diverse molecular chemistries (e.g., thiols, diazonium salts, alkyl halides, and electron‐deficient species) to tailor their surface properties ...
Ramiro Quirós‐Ovies +2 more
wiley +1 more source
Planar Graphs under Pythagorean Fuzzy Environment
Graph theory plays a substantial role in structuring and designing many problems. A number of structural designs with crossings can be found in real world scenarios. To model the vagueness and uncertainty in graphical network problems, many extensions of
Muhammad Akram +2 more
doaj +1 more source

