Results 191 to 200 of about 4,847 (217)
Graph-Theoretic Limits of Distributed Computation: Entropy, Eigenvalues, and Chromatic Numbers. [PDF]
Deylam Salehi MR, Malak D.
europepmc +1 more source
Antimicrobial Efficacy of Green Silver Nanoparticles Synthesized Using <i>Crataegus monogyna</i> Extract. [PDF]
Lite MC +8 more
europepmc +1 more source
Linking Grape Cell Wall Composition and Phenolic Release to Wine Quality: Effects of Methyl Jasmonate-Loaded Chitosan Nanoparticles in Monastrell. [PDF]
Gil-Muñoz R +8 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The strong chromatic index of graphs with edge weight eight
Journal of Combinatorial Optimization, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiangqian Zhou +2 more
exaly +3 more sources
Strong Chromatic Index of 2-Degenerate Graphs
Journal of Graph Theory, 2013Summary: We prove that the strong chromatic index of a 2-degenerate graph is linear in the maximum degree \(\Delta \). This includes the class of all chordless graphs (graphs in which every cycle is induced) which in turn includes graphs where the cycle lengths are multiples of four, and settles a problem by \textit{R. J. Faudree} et al. [Ars Comb. 29B,
Gérard Jennhwa Chang +1 more
exaly +3 more sources
Strong chromatic index of K4-minor free graphs
Information Processing Letters, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weifan Wang, Yiqiao Wang
exaly +2 more sources
Strong edge chromatic index of the generalized Petersen graphs
Applied Mathematics and Computation, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baoyindureng Wu
exaly +2 more sources
Strong Chromatic Index of Sparse Graphs
Journal of Graph Theory, 2015AbstractA 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 , is the least number of colors in a strong edge coloring of G. Chang and Narayanan (J Graph Theory 73(2) (2013), 119–126) proved recently that for a 2‐degenerate graph G.
Daqing Yang, Xuding Zhu
openaire +2 more sources

