Results 131 to 140 of about 196,625 (294)
On the k-Structure Ratio in Planar and Outerplanar Graphs
Discrete Mathematics & Theoretical Computer Science, 2008 A planar k-restricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar k-restricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar k-
Gruia Calinescu, Cristina G. Fernandes
doaj
The S-rule and 1-d representation for the traversal of a planar graph in AEC industry
, 2023 Luxin Luo, Sida Kong
openalex +2 more sources
Advanced Functional Materials, EarlyView.This work addresses the challenge of current–voltage asymmetry in scalable laminated semitransparent organic photovoltaics (OPVs) for indoor applications. Vertical stratification of materials is shown to create an energy barrier, leading to performance differences under different illumination directions.
Gulzada Beket +15 more
wiley +1 more source
Advanced Functional Materials, EarlyView.The study develops elastin–fibrin scaffolds and evaluates angiogenesis using the chorioallantoic membrane (CAM) model. Advanced imaging with confocal microscopy and Indocyanine Green dye enables precise 3D quantification of vascular networks. Findings demonstrate superior microvessel visualization compared to micro‐CT using Microfil and Optiray 350 ...
Ece Melis Er +8 more
wiley +1 more source
A New Memory Effect in Bulk Crystals of 1T‐TaS2
Advanced Functional Materials, EarlyView.A new memory effect is discovered in 1T‐TaS₂, appearing as a temperature shift in the metal to insulator transition, coinciding with the recently reported ramp reversal memory. These findings imply that ramp reversal memory is an emergent phenomenon, likely to appear in many different systems that share a few basic properties, which are discussed in ...
Avital Fried +4 more
wiley +1 more source
Straight-line drawings of 1-planar graphs
Computational GeometryA graph is 1-planar if it can be drawn in the plane so that each edge is crossed at most once. However, there are 1-planar graphs which do not admit a straight-line 1-planar drawing. We show that every 1-planar graph has a straight-line drawing with a two-coloring of the edges, so that edges of the same color do not cross.
openaire +2 more sources
Advanced Functional Materials, EarlyView.This study presents a capacitive hydrogen sensor with a simple structure and process. Sonication‐induced Pd nanogaps modulate the effective electrode area in response to hydrogen concentration, resulting in capacitance changes within a range predefined by physical parameters.
Sang‐kil Lee +9 more
wiley +1 more source
Advanced Functional Materials, EarlyView.The chemical composition and band alignment are systematically investigated at the TiO2/InP heterointerface. Thin TiO2 films are deposited by ALD on atomically ordered, P‐terminated p‐InP(100). By combining UPS, XPS, and ab initio molecular dynamics, the atomistic structure and electronic alignment are revealed.
Mohammad Amin Zare Pour +11 more
wiley +1 more source
Advanced Functional Materials, EarlyView.[001]‐oriented Sb2Se3 film with improved crystallinity and adjusted composition is achieved via a new thermal treatment approach consisting of preliminary annealing of the Sb layer before its selenization. The findings of this work demonstrate enhanced charge carriers' transportation, a stable performance, and an improvement of H2 generation from ...
Magno B. Costa +7 more
wiley +1 more source
The basis number of 1-planar graphs
Let $B$ be a set of Eulerian subgraphs of a graph $G$. We say $B$ forms a $k$-basis if it is a minimum set that generates the cycle space of $G$, and any edge of $G$ lies in at most $k$ members of $B$. The basis number of a graph $G$, denoted by $b(G)$, is the smallest integer such that $G$ has a $k$-basis. A graph is called 1-planar (resp.
Bazargani, Saman +4 more
openaire +2 more sources