Results 41 to 50 of about 4,890 (237)
From light edges to strong edge-colouring of 1-planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A strong edge-colouring of an undirected graph $G$ is an edge-colouring where every two edges at distance at most~$2$ receive distinct colours. The strong chromatic index of $G$ is the least number of colours in a strong edge-colouring of $G$.
Julien Bensmail +3 more
doaj +1 more source
On Proper (Strong) Rainbow Connection of Graphs
Discussiones Mathematicae Graph Theory, 2021 A path in an edge-colored graph G is called a rainbow path if no two edges on the path have the same color. The graph G is called rainbow connected if between every pair of distinct vertices of G, there is a rainbow path.
Jiang Hui +3 more
doaj +1 more source
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
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
Oriented Incidence Colourings of Digraphs
Discussiones Mathematicae Graph Theory, 2019 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