Results 21 to 30 of about 259,273 (236)
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
Symmetry, 2023 The problem of strong edge coloring discusses assigning colors to the edges of a graph such that distinct colors are assigned to any two edges which are either adjacent to each other or are adjacent to a common edge.
S. Vikram, S. Balaji
semanticscholar +1 more source
Strong Chromatic Index of Chordless Graphs [PDF]
Journal of Graph Theory, 2014 AbstractA strong edge coloring of a graph is an assignment of colors to the edges of the graph such that for every color, the set of edges that are given that color form an induced matching in the graph. The strong chromatic index of a graph G, denoted by , is the minimum number of colors needed in any strong edge coloring of G.
Basavaraju, Manu, Francis, Mathew C.
openaire +3 more sources
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 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
The Strong Chromatic Index of Random Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2005 The strong chromatic index of a graph $G$, denoted by $\chi_s(G)$, is the minimum number of colors needed to color its edges so that each color class is an induced matching. In this paper we analyze the asymptotic behavior of this parameter in a random graph $G(n,p)$, for two regions of the edge probability $p=p(n)$.
Alan Frieze +2 more
openaire +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 list-chromatic index of subcubic graphs [PDF]
Discrete Mathematics, 2018 11 pages, 3 ...
Tianjiao Dai +3 more
openaire +3 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