Results 21 to 30 of about 4,847 (217)
A Receptor-Based Explanation for Tsetse Fly Catch Distribution between Coloured Cloth Panels and Flanking Nets. [PDF]
PLoS Neglected Tropical Diseases, 2015 Tsetse flies transmit trypanosomes that cause nagana in cattle, and sleeping sickness in humans. Therefore, optimising visual baits to control tsetse is an important priority.
Roger D Santer
doaj +1 more source
Strong Edge Coloring of Generalized Petersen Graphs
Mathematics, 2020 A strong edge coloring of a graph G is a proper edge coloring such that every color class is an induced matching. In 2018, Yang and Wu proposed a conjecture that every generalized Petersen graph P(n,k) with k≥4 and n>2k can be strong edge colored with ...
Ming Chen, Lianying Miao, Shan Zhou
doaj +1 more source
A Bound on the Strong Chromatic Index of a Graph
Journal of Combinatorial Theory, Series B, 1997 The strong chromatic index \(s\chi'(G)\) of a graph \(G\) is the minimum number of colors in a proper edge coloring of a graph in which no edge is adjacent to an edge of the same color. It is proved that \(s\chi'(G)\leq 1.998\Delta^2\), where \(\Delta\) is the maximum degree of a vertex of \(G\). This answers a question of Erdös and Nešetřil, which was
Molloy, M., Reed, B.
openaire +2 more sources
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
Strong Edge Coloring of K4(t)-Minor Free Graphs
Axioms, 2023 A strong edge coloring of a graph G is a proper coloring of edges in G such that any two edges of distance at most 2 are colored with distinct colors. The strong chromatic index χs′(G) is the smallest integer l such that G admits a strong edge coloring ...
Huixin Yin, Miaomiao Han, Murong Xu
doaj +1 more source
On the strong chromatic index of cyclic multigraphs
Discrete Applied Mathematics, 2000 The strong chromatic index \(\text{sq}(G)\) of a multigraph \(G\) is the smallest number of colours needed to colour the edges of \(G\) so that each colour class is an induced matching. The largest size of a submultigraph of \(G\) without any induced matching of size two is denoted by \(\eta(G)\).
Pavol Gvozdjak +3 more
openaire +2 more sources
Advanced Science, 2020 Acclimatable colors in response to environmental stimuli, which are naturally endowed with some living things, can provide an opportunity for humans to recognize hazardous substances without taking empirical risks.
Young Jin Yoo +9 more
doaj +1 more source
Remote Sensing, 2020 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
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
The strong chromatic index of Halin graphs
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hsin-Hao Lai, Ko-Wei Lih, Ping-Ying Tsai
openaire +2 more sources