Results 31 to 40 of about 259,273 (236)
Managed realignment (MR) sites are being implemented to compensate for the loss of natural saltmarsh habitat due to sea level rise and anthropogenic pressures. However, MR sites have been recognised to have lower morphological variability and coverage of
Jonathan Dale +5 more
doaj +1 more source
On the precise value of the strong chromatic index of a planar graph with a large girth [PDF]
A strong $k$-edge-coloring of a graph $G$ is a mapping from $E(G)$ to $\{1,2,\ldots,k\}$ such that every pair of distinct edges at distance at most two receive different colors.
G. Chang, Guan-Huei Duh
semanticscholar +1 more source
Strong Edge-Coloring Of Planar Graphs
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
Strong chromatic index of sparse graphs
A coloring of the edges of a graph $G$ is strong if each color class is an induced matching of $G$. The strong chromatic index of $G$, denoted by $ _{s}^{\prime}(G)$, is the least number of colors in a strong edge coloring of $G$. In this note we prove that $ _{s}^{\prime}(G)\leq (4k-1) (G)-k(2k+1)+1$ for every $k$-degenerate graph $G$.
DÄbski, MichaĆ +2 more
openaire +2 more sources
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
This study set out to assess the acetone content in rye sweet mashes prepared using the thermal-pressure method of starch liberation, and to investigate the formation of 2-propanol during the fermentation process.
Katarzyna Pielech-Przybylska +6 more
doaj +1 more source
Strong chromatic index of k-degenerate graphs [PDF]
A strong edge coloring of a graph G is a proper edge coloring in which every color class is an induced matching. The strong chromatic index Ï s âČ ( G ) of a graph G is the minimum number of colors in a strong edge coloring of G . In this note, we improve
Tao-Ming Wang
semanticscholar +1 more source
Controlled syntheses of lanthanide coordination polymers based on the dihydroxybenzoquinone (DHBQ) organic linker afforded large single crystals of LnâDHBQ CPs (Ln = Yb, Nd). A novel structural variant of YbâDHBQ is identified by means of single crystal diffraction analysis.
Marina I. Schönherr +7 more
wiley +1 more source
This review highlights how machine learning (ML) algorithms are employed to enhance sensor performance, focusing on gas and physical sensors such as haptic and strain devices. By addressing current bottlenecks and enabling simultaneous improvement of multiple metrics, these approaches pave the way toward nextâgeneration, realâworld sensor applications.
Kichul Lee +17 more
wiley +1 more source
A vertically stacked, DEAâdriven photonic array inspired by cephalopod skin, featuring highly crystalline colloidal crystal gels with vivid color, low FWHM and scalability is presented. The multilayer design removes lateral pixel interference, achieving nearâ100% fill factor with fully independent RGB actuation.
Maga Kim +11 more
wiley +1 more source

