Results 91 to 100 of about 57,891 (276)
The Vegan Villain Sets Out to The End of Summer: Functionalized Coatings as Biohybrid UV‐Sensors
This study introduces biohybrid coatings incorporating E. coli biomass expressing photoconvertible fluorescent proteins as UV‐A responsive elements. Upon irradiation at 400 nm, the coatings exhibit an irreversible fluorescence shift from green to red within 15 min. Notably, the photoconversion capability is retained after >1 year of storage.
Amelie Skopp +3 more
wiley +1 more source
New bounds for the acyclic chromatic index
An edge coloring of a graph $G$ is called an acyclic edge coloring if it is proper and every cycle in $G$ contains edges of at least three different colors. The least number of colors needed for an acyclic edge coloring of $G$ is called the acyclic chromatic index of $G$ and is denoted by $a'(G)$.
openaire +3 more sources
This critical review presents a comprehensive roadmap for the precision 3D printing of cellulose. Quantitative correlations link ink formulation and rheological properties to print fidelity and final material performance. This framework guides the development of advanced functional materials, from biomedical scaffolds to electromagnetic shielding ...
Majed Amini +3 more
wiley +1 more source
Asymptotics of the Chromatic Index for Multigraphs
For a multigraph \(G\), let \(D(G)\) denote maximum degree and set \[ \Gamma(G)=\max\Biggl\{{|E(W)|\over \lfloor|W|/2\rfloor}: W\subseteq V, 3\leq |W|\equiv 1\pmod 2\Biggr\}. \] We show that the chromatic index \(\chi'(G)\) is asymptotically \(\max\{D(G),\Gamma(G)\}\). The latter is, by a theorem of \textit{J. Edmonds} [J. Res. Nat. Bur.
openaire +2 more sources
Recent Advances on Thermochromic Inks for Security Applications
Thermochromic security inks have garnered interest in recent years as security elements for authentication, information encryption, and anti‐counterfeiting. This review outlines different types of thermochromic materials, how they have been developed as functional inks, and how advancements in property enhancement, sustainability, and printing ...
Duarte B. Oliveira +5 more
wiley +1 more source
Upper Bounds for the Strong Chromatic Index of Halin Graphs
The strong chromatic index of a graph G, denoted by χ′s(G), is the minimum number of vertex induced matchings needed to partition the edge set of G. Let T be a tree without vertices of degree 2 and have at least one vertex of degree greater than 2.
Hu Ziyu, Lih Ko-Wei, Liu Daphne Der-Fen
doaj +1 more source
Responsive Visible‐Wavelength Metasurfaces from Porous Silicon Based on Fano Guided‐Mode Resonance
The article introduces mesoporous silicon metasurfaces (pSi‐MS) supporting Fano guided‐mode resonances in the visible regime. By combining top‐down lithographic patterning of 2D gratings with bottom‐up electrochemical porosification, the approach realizes a new class of responsive metasurfaces, enabling highly sensitive and portable platforms for small
Tomoshree Dash +4 more
wiley +1 more source
Engineered Optical Fibers for Deep‐Tissue Applications
This review establishes a foundational framework for designing optical fibers for deep‐tissue medicine. It systematically links material innovations like polymers and hydrogels with structural paradigms to enable state‐of‐the‐art diagnostics, including endoscopy and biosensing, and targeted therapeutics, guiding future clinical translation.
Yuzhen Li +16 more
wiley +1 more source
Characterization and Optimization of Field of View in a Holographic Waveguide Display
The paper presents the characterization of the field of view (FOV) in a holographic waveguide display (HWD) with a broadband spectrum image source. The influences of parameters such as grating slanted angle of volume holographic grating (VHG), grating ...
Zhongwen Shen +3 more
doaj +1 more source
The List Edge Coloring and List Total Coloring of Planar Graphs with Maximum Degree at Least 7
A graph G is edge k-choosable (respectively, total k-choosable) if, whenever we are given a list L(x) of colors with |L(x)| = k for each x ∈ E(G) (x ∈ E(G) ∪ V (G)), we can choose a color from L(x) for each element x such that no two adjacent (or ...
Sun Lin +3 more
doaj +1 more source

