Results 71 to 80 of about 1,143 (224)
Antimony‐doped tin oxide (ATO) thin films were deposited by aerosol‐assisted chemical vapor deposition (AACVD) and systematically investigated to establish correlations between Sb doping level, structural properties and optoelectronic performance. Optimized films exhibited low sheet resistance, high carrier concentrations, and high visible transparency
Iqra Ramzan +2 more
wiley +1 more source
List packing number of bounded degree graphs [PDF]
We investigate the list packing number of a graph, the least k such that there are always k disjoint proper list-colourings whenever we have lists all of size k associated to the vertices.
Davies, E. +3 more
core +1 more source
Packing Chromatic Number of Circular Fans and Mesh of Trees
The packing chromatic number $\raisebox{2pt}{$\chi$}_{\rho}(G)$ of a graph $G$ is the smallest integer $k$ for which there exists a mapping $\pi:V(G)\longrightarrow \{1,2,...,k\}$ such that any two vertices of color $i$ are at distance at least $i+1$.
Indra Rajasingh, S. Roy, Albert William
openaire +1 more source
Gap‐Free Information Transfer in 4D‐STEM via Fusion of Complementary Scattering Channels
Fused Full‐Field STEM (FF‐STEM) is introduced as a 4D‐STEM imaging modality that combines direct ptychography with tilt‐corrected dark‐field reconstruction in a single acquisition. Fourier‐space fusion using Wiener‐type spectral weighting closes the low‐frequency contrast gap inherent to bright‐field methods, delivering gap‐free, dose‐efficient, near ...
Shengbo You +15 more
wiley +1 more source
This work employs monolayer molecular crystals (MMCs) as bi‐functional active layers in organic light‐emitting transistors (OLETs). Thanks to the efficient horizontal hole transport and vertical hole injection, the OLETs show a high mobility of 6.64 cm2V−1s−1 and exhibit uniform area emission.
Zhengyao Pu +9 more
wiley +1 more source
S-packing chromatic critical graphs [PDF]
For a non-decreasing sequence of positive integers $S=(s_1,s_2,ldots)$, the $S$-packing chromatic number of a graph $G$ is denoted by $chi_S(G)$. In this paper, $chi_S$-critical graphs are introduced as the graphs $G$ such that $chi_S(H) < chi_S(G)$ for ...
Gozüpek, Didem +3 more
core +2 more sources
Notes on complexity of packing coloring [PDF]
A packing k-coloring for some integer k of a graph G = (V, E) is a mapping ϕ : V → {1, . . . , k} such that any two vertices u, v of color ϕ(u) = ϕ(v) are in distance at least ϕ(u) + 1. This concept is motivated by frequency assignment problems.
Bernard Lidický +7 more
core +2 more sources
The packing chromatic number of the square lattice is at least 12
The packing chromatic number $χ_ρ(G)$ of a graph $G$ is the smallest integer $k$ such that the vertex set $V(G)$ can be partitioned into disjoint classes $X_1, ..., X_k$, where vertices in $X_i$ have pairwise distance greater than $i$. For the 2-dimensional square lattice $\mathbb{Z}^2$ it is proved that $χ_ρ(\mathbb{Z}^2) \geq 12$, which improves the ...
Jan Ekstein +3 more
openaire +2 more sources
Redefining Crystalline Silicon: Unlocking New Horizons in Transparent and Flexible Photovoltaics
Crystalline silicon is presented as a platform for transparent and flexible photovoltaics. This review article outlines design principles for optical strategies to fabricate transparent silicon solar cells, mechanical strategies that mitigate silicon brittleness, and emerging concepts such as singlet‐fission spectral conversion and tandem architectures,
Kangmin Lee
wiley +1 more source
On Packing Colorings of Distance Graphs [PDF]
International audienceThe {\em packing chromatic number} $\chi_{\rho}(G)$ of a graph $G$ is the least integer $k$ for which there exists a mapping $f$ from $V(G)$ to $\{1,2,\ldots ,k\}$ such that any two vertices of color $i$ are at distance at least $i ...
Togni, Olivier
core +1 more source

