Results 251 to 260 of about 2,243,492 (285)

List Strong Edge-Colorings of Sparse Graphs

Bulletin of the Malaysian Mathematical Sciences Society, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deng, Kecai, Huang, Ningge, Zhang, Haiyang, Zhou, Xiangqian   +3 more
openaire   +2 more sources

d-strong Edge Colorings of Graphs

Graphs and Combinatorics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kemnitz, Arnfried, Marangio, Massimiliano   +1 more
openaire   +2 more sources

Strong edge coloring of circle graphs

European Journal of Combinatorics, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dębski, Michał, Śleszyńska-Nowak, Małgorzata   +1 more
openaire   +2 more sources

Strong Edge-Coloring of Pseudo-Halin Graphs

Bulletin of the Malaysian Mathematical Sciences Society, 2019
zbMATH 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, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xu, Min, Li, Pingshan
openaire   +2 more sources

The strong edge-coloring for graphs with small edge weight

Discrete Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Lily, Huang, Mingfang, Yu, Gexin, Zhou, Xiangqian   +3 more
openaire   +3 more sources

Strong Edge Colorings of Graphs

2015
In 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

2020
We 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, de Joannis de Verclos, Rémi, Kang, Ross, Pirot, François   +3 more
openaire   +4 more sources

Conditional (edge-)fault-tolerant strong Menger (edge) connectivity of folded hypercubes

Theoretical Computer Science, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qi Cheng, Pingshan Li, Min Xu
openaire   +2 more sources

Security and Privacy on 6G Network Edge: A Survey

IEEE Communications Surveys and Tutorials, 2023
Bomin Mao, Jiajia Liu, Yingying Wu
exaly