Results 111 to 120 of about 10,769 (289)
List Star Edge-Coloring of Subcubic Graphs
Discussiones Mathematicae Graph Theory, 2018 A star edge-coloring of a graph G is a proper edge coloring such that every 2-colored connected subgraph of G is a path of length at most 3. For a graph G, let the list star chromatic index of G, ch′st(G), be the minimum k such that for any k-uniform ...
Kerdjoudj Samia +2 more
doaj +1 more source
On the Strong Chromatic Index of Sparse Graphs
The Electronic Journal of Combinatorics, 2018 The strong chromatic index of a graph $G$, denoted $\chi'_s(G)$, is the least number of colors needed to edge-color $G$ so that edges at distance at most two receive distinct colors. The strong list chromatic index, denoted $\chi'_{s,\ell}(G)$, is the least integer $k$ such that if arbitrary lists of size $k$ are assigned to each edge then $G$ can be ...
Philip DeOrsey +9 more
openaire +4 more sources
Advanced Science, EarlyView.Light wavelength encodes distinct macrophage fates through mitochondrial and metabolic remodeling. Red 625 nm irradiation induces glycolysis, mitochondrial fission, and M1 polarization, whereas near‐infrared 850 nm irradiation promotes fatty acid oxidation, mitochondrial fusion, and M2 polarization.
Qiusheng Shi +12 more
wiley +1 more source
Chromatic aberrations of radial gradient-index lenses. II. Selfoc lenses [PDF]
, 1996 Simple equations used for analyzing chromatic aberrations of Selfoc lenses were derived in terms of Buchdahl chromatic coordinates and Buchdahl dispersion constants.
Sharma, Anurag, Siva Rama Krishna, K.
core +1 more source
Chromatic Aberration in Wavefront Coding Imaging with Trefoil Phase Mask
PhotonicsThe refractive index of the lenses used in optical designs varies with wavelength, causing light rays to fail when focusing on a single plane. This phenomenon is known as chromatic aberration (CA), chromatic distortion, or color fringing, among other ...
Miguel Olvera-Angeles +2 more
doaj +1 more source
Strong Edge-Coloring Of Planar Graphs
Discussiones Mathematicae Graph Theory, 2017 A strong edge-coloring of a graph is a proper edge-coloring where each color class induces a matching. We denote by 𝜒's(G) the strong chromatic index of G which is the smallest integer k such that G can be strongly edge-colored with k colors. It is known
Song Wen-Yao, Miao Lian-Ying
doaj +1 more source
Advanced Science, EarlyView.This work demonstrates a paradigm‐shifting strategy to simultaneously achieve broadband wavelength tunability and single‐mode control within a single perovskite microwire structure. Using a facile heating‐assisted solid–solid anion‐exchange strategy, we synthesized phase‐pure CsPbClxBr3‐x microwires that exhibit the widest reported continuous lasing ...
Bingwang Yang +7 more
wiley +1 more source
Chromatic Index Critical Graphs of Orders 11 and 12 [PDF]
, 1997 A chromatic-index-critical graph G on n vertices is non-trivial if it has at most \Deltab n 2 c edges. We prove that there is no chromatic-index-critical graph of order 12, and that there are precisely two non-trivial chromatic index critical graphs ...
Steffen, E +3 more
core +1 more source
Advanced Science, EarlyView.ABSTRACT The shift from point‐based thermal sensing to filter‐free thermal imaging requires luminescent thermometers that exhibit pronounced and thermally driven spectral changes within spectral regions matching the sensitivity profiles of the red, green and blue (RGB) channels of a digital camera.
Y. Abe +3 more
wiley +1 more source
Multigraphs with High Chromatic Index [PDF]
, 2009 In this thesis we take a specialized approach to edge-colouring by focusing exclusively on multigraphs with high chromatic index. The bulk of our results can be classified into three categories.
McDonald, Jessica
core