Results 51 to 60 of about 3,659,008 (292)
Residual adhesive after electrode loading in adhesive‐assisted resistance spot welding is quantified through a traceable experimental‐to‐digital workflow. Chromatic confocal topography provides calibrated surface‐height data, while OpenCV detects the electrode imprint and integrates adhesive height into comparable volume metrics.
Sung‐Min Wi, Jiangdong Zhao
wiley +1 more source
About Berge–Füredi’s conjecture on the chromatic index of hypergraphs
We prove that the chromatic index of a hypergraph $\mathcal{H}$ satisfies the Berge–Füredi conjectured bound $\mathrm{q}(\mathcal{H}\le \Delta \bigl ([\mathcal{H}_2]\bigr )+1$ under certain hypotheses on the antirank $\mathrm{ar}(\mathcal{H})$ or on the ...
Bretto, Alain +2 more
doaj +1 more source
Oriented Incidence Colourings of Digraphs
Brualdi and Quinn Massey [6] defined incidence colouring while study- ing the strong edge chromatic index of bipartite graphs. Here we introduce a similar concept for digraphs and define the oriented incidence chromatic number.
Duffy Christopher +3 more
doaj +1 more source
On critical graphs with chromatic index 4 [PDF]
It is shown that the number of vertices of valency 2 in a critical graph with chromatic index 4 is at most 1/3 of the total number of vertices, and that there exist critical graphs with just one vertex of valency 2, but none with exactly two vertices of ...
Jakobsen, Ivan Tafteberg +1 more
core +1 more source
A new class of sulfur‐free, oxygen‐bridged dibenzofuran‐based polymers is developed for ultrahigh‐refractive‐index applications. The rigid π‐extended architecture and enhanced molecular polarizability enable exceptional optical performance, combining refractive indices up to 1.848 with high Abbe numbers and full visible transparency. This work offers a
Hend A. Hegazy +5 more
wiley +1 more source
The strong chromatic index of 1-planar graphs [PDF]
The chromatic index $\chi'(G)$ of a graph $G$ is the smallest $k$ for which $G$ admits an edge $k$-coloring such that any two adjacent edges have distinct colors.
Yiqiao Wang +3 more
doaj +1 more source
The chromatic index of multigraphs of order at most 10 [PDF]
The maximum of the maximum degree and the “odd set quotients” provides a well-known lower bound φ(G) for the chromatic index of a multigraph G. Plantholt proved that if G is a multigraph of order at most 8, its chromatic index equals φ(G) and that if G ...
Plantholt, Michael J. +3 more
core +1 more source
Ultra‐narrow green multi‐resonance thermally activated delayed fluorescence emitters have been developed by linear π‐extension strategy using tetracyclic naphtho[2,3‐b]benzofuran unit. The resulting phosphorescence‐sensitized OLEDs achieve a maximum external quantum efficiency of 37.7% in the bottom‐emitting architecture, while the complementary top ...
Eo Jin Jeon +7 more
wiley +1 more source
The skew chromatic index of a graph
A skew edge colouring of a graph G is a pair of edge colourings of G such that no two edges are assigned the same unordered pair of colours. The skew chromatic index s(G) is the minimum number of colours required for a skew edge colouring of G. It is shown that s(G) is at most \(0(G)+4\). Better bounds are obtained when G is cyclic, cubic or bipartite.
openaire +3 more sources
In this study, we fabricate photovoltaic retinal implants with pyrolytic carbon electrodes and test their ability to stimulate mouse and pig retinas when illuminated with near‐infrared light. We find increased spiking activity in both animal models compared to spontaneous activity and TTX controls and analyze the spike amplitude, latency and frequency.
Akihiro Matsumoto +10 more
wiley +1 more source

