Results 131 to 140 of about 10,769 (289)
On the chromatic index of almost all graphs [PDF]
, 1977 Vizing has shown that if G is a simple graph with maximum vertex-degree ϱ, then the chromatic index of G is either ϱ or ϱ + 1. In this note we prove that almost all graphs have a unique vertex of maximum degree, and we deduce that almost all graphs have ...
Wilson, Robin J, Erdős, P
core +1 more source
Characterization and Optimization of Field of View in a Holographic Waveguide Display
IEEE Photonics Journal, 2017 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
Advanced Science, EarlyView.Both SVF and CD31+ SVF improve spontaneous osteoarthritis, but CD31+ enrichment refines the therapeutic profile rather than broadly enhancing all effects. More distinct benefits are observed in extracellular matrix remodeling, osteochondral integrity, and subchondral/trabecular bone preservation, supporting CD31+‐enriched SVF as a biologically enhanced
Sijia Zhou +16 more
wiley +1 more source
On Strong Chromatic Index of Halin Graph [PDF]
, 2008 A strong k-edge-coloring of a graph G is an assignment of k colors to the edges of G in such a way that any two edges meeting at a common vertex, or being adjacent to the same edge of G, are assigned different colors.
W. C. Shiu, W. K. Tam, P. C. B. Lam
core
Color diversity index : the effect of chromatic adaptation [PDF]
, 2011 Common descriptors of light quality fail to predict the chromatic diversity produced by the same illuminant in different contexts. The aim of this paper was to study the influence of the chromatic adaptation in the context of the development of the ...
Nascimento, Sérgio M. C. +3 more
core +1 more source
New bounds for the acyclic chromatic index
Discrete Mathematics, 2016 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
Advanced Science, EarlyView.Described herein is the development of an organic eutectic gel based on a deep eutectic mixture of naturally derived betaine and lactic acid. The eutectic gels exhibit reversible color‐switching in response to multiple stimuli including strain, UV light, and temperature, enabling advanced applications in information security, intelligent wearable ...
Zhiang Bai +3 more
wiley +1 more source
Upper bounds on the star chromatic index for bipartite graphs [PDF]
, 2020 An area in graph theory is graph colouring, which essentially is a labeling of the vertices or edges according to certain constraints. In this thesis we consider star edge colouring, which is a variant of proper edge colouring where we additionally ...
Melinder, Victor
core
Advanced Science, EarlyView.Task‐adaptive programmable optics enables label‐free virtual staining through optical‐attention‐guided acquisition and reconstruction. By optimizing wavelength, illumination angle, exposure time, and imaging depth, the framework learns task‐relevant optical measurements, generating clinically interpretable virtual stains with improved fidelity, non ...
Tianyue He +13 more
wiley +1 more source
Advanced Science, EarlyView.Glioma resection surgery is challenging because of the infiltrative growth of the tumor into nearby tissue and the different surgical requirements for gliomas with different mutation types. To improve the precision and effectiveness of glioma resection, this study developed a new imaging probe that enables the tumor boundary and mutation status to be ...
Dongdong Wu +12 more
wiley +1 more source