Results 291 to 300 of about 2,257,273 (319)
Some of the next articles are maybe not open access.
List Strong Edge-Colorings of Sparse Graphs
Bulletin of the Malaysian Mathematical Sciences Society, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deng, Kecai +3 more
openaire +2 more sources
The strong edge-coloring for graphs with small edge weight
Discrete Mathematics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lily Chen, Gexin Yu, Xiangqian Zhou
exaly +4 more sources
d-strong Edge Colorings of Graphs
Graphs and Combinatorics, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kemnitz, Arnfried +1 more
openaire +2 more sources
Strong edge-colouring and induced matchings [PDF]
Information Processing Letters, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hervé Hocquard
exaly +2 more sources
Strong edge coloring of circle graphs
European Journal of Combinatorics, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dębski, Michał +1 more
openaire +2 more sources
Adjacent strong edge coloring of graphs
Applied Mathematics Letters, 2002 A proper edge coloring of a graph is an adjacent strong edge coloring if, for every adjacent vertices \(u\) and \(v\), the set of colors of all edges at \(u\) is different from the set of all colors of edges at \(v\). The authors determine the minimum number \(k\) such that a tree (a cycle, a complete graph) has an adjacent strong edge coloring with ...
Zhang, Zhongfu +2 more
exaly +3 more sources
Strong Edge-Coloring of Pseudo-Halin Graphs
Bulletin of the Malaysian Mathematical Sciences Society, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiangwen Li, Jian-Bo Lv
openaire +1 more source
Edge-fault-tolerant strong Menger edge connectivity on regular graphs
Theoretical Computer Science, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xu, Min, Li, Pingshan
openaire +2 more sources
Strong Edge Colorings of Graphs
2015In the preceding chapters we have discussed unrestricted edge colorings that, in a variety of ways, induce vertex colorings that are either vertex-distinguishing or neighbor-distinguishing. In this chapter, we turn our attention from unrestricted edge colorings to proper edge colorings that induce set-defined vertex colorings which are either vertex ...
openaire +1 more source
Approximate Strong Edge-Colouring of Unit Disk Graphs
2020We show that the strong chromatic index of unit disk graphs is efficiently 6-approximable. This improves on 8-approximability as shown by Barrett, Istrate, Kumar, Marathe, Thite, and Thulasidasan [1]. We also show that strong edge-6-colourability is NP-complete for the class of unit disk graphs.
Grelier, Nicolas +3 more
openaire +4 more sources