Results 221 to 230 of about 60,707 (240)
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
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 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-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
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
Recent progress on strong edge-coloring of graphs
Discrete Mathematics, Algorithms and Applications, 2019A strong edge-coloring of a graph [Formula: see text] is a partition of its edge set [Formula: see text] into induced matchings. In this paper, we gave a short survey on recent results about strong edge-coloring of a graph.
Kecai Deng, Gexin Yu, Xiangqian Zhou
openaire +4 more sources
Parity and strong parity edge-colorings of graphs
Journal of Combinatorial Optimization, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hsiang-Chun Hsu, Gerard J. Chang
openaire +3 more sources
Strong edge-coloring of subcubic planar graphs
Discrete Mathematics, Algorithms and Applications, 2017A strong[Formula: see text]-edge-coloring of a graph [Formula: see text] is a mapping [Formula: see text]: [Formula: see text], such that [Formula: see text] for every pair of distinct edges at distance at most two. The strong chromatical index of a graph [Formula: see text] is the least integer [Formula: see text] such that [Formula: see text] has a ...
Yuehua Bu, Hongguo Zhu
openaire +2 more sources
Strong edge-coloring of $(3, Δ)$-bipartite graphs
Discret. Math., 2014A strong edge-coloring of a graph $G$ is an assignment of colors to edges such that every color class induces a matching. We here focus on bipartite graphs whose one part is of maximum degree at most $3$ and the other part is of maximum degree $Δ$. For every such graph, we prove that a strong $4Δ$-edge-coloring can always be obtained.
Julien Bensmail +2 more
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