Results 131 to 140 of about 5,252 (152)
Some of the next articles are maybe not open access.
Strong edge coloring of circle graphs
European Journal of Combinatorics, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michal Debski +1 more
openaire +2 more sources
A polynomial time algorithm for strong edge coloring of partial k-trees
Discrete Applied Mathematics, 2004 A matching M in a graph is called induced if there is no edge in the graph connecting two edges of M. The strong edge coloring problem is to find an edge coloring of a given graph with minimum number of colors such that each color class is an induced ...
Mohammad R Salavatipour
exaly +2 more sources
d-strong Edge Colorings of Graphs
Graphs and Combinatorics, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arnfried Kemnitz, Massimiliano Marangio
openaire +2 more sources
On strong list edge coloring of subcubic graphs
Discrete Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong Zhu, Zhengke Miao
exaly +3 more sources
Strong edge-colorings of sparse graphs with 3Δ − 1 colors
Information Processing Letters, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiangwen Li +3 more
openaire +1 more source
On Strong Edge-Coloring of Claw-Free Subcubic Graphs
Graphs and Combinatorics, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jian-Bo Lv, Jianxi Li, Xiaoxia Zhang
openaire +1 more source
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, Li Xiangwen
exaly +2 more sources
A Note on Strong Edge Coloring of Sparse Graphs
Acta Mathematica Sinica, English Series, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dong, Wei, Li, Rui, Xu, Bao Gang
openaire +2 more sources
Odd graph and its applications to the strong edge coloring [PDF]
Applied Mathematics and Computation, 2018 A strong edge coloring of a graph is a proper edge coloring in which every color class is an induced matching. The strong chromatic index $χ_s'(G)$ of a graph $G$ is the minimum number of colors in a strong edge coloring of $G$. Let $Δ\geq 4$ be an integer. In this note, we study the odd graphs and show the existence of some special walks.
Tao Wang
exaly +4 more sources
Strong edge-colorings of planar graphs with small girth
Applied Mathematics and Computation, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yirong Guo +2 more
openaire +2 more sources