Results 211 to 220 of about 5,178 (231)

Strong edge coloring of circle graphs

European Journal of Combinatorics, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michal Debski, Malgorzata Sleszynska-Nowak   +1 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.
Arnfried Kemnitz, Massimiliano Marangio
openaire   +2 more sources

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

Strong edge-colorings of sparse graphs with 3Δ − 1 colors

Information Processing Letters, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiangwen Li, Yangfan Li, Jian-Bo Lv, Tao Wang 0005   +3 more
openaire   +1 more source

On Strong Edge-Coloring of Claw-Free Subcubic Graphs

Graphs and Combinatorics, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jian-Bo Lv, Jianxi Li, Xiaoxia Zhang
openaire   +1 more source

A Note on Strong Edge Coloring of Sparse Graphs

Acta Mathematica Sinica, English Series, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dong, Wei, Li, Rui, Xu, Bao Gang
openaire   +2 more sources

Strong edge-colorings of planar graphs with small girth

Applied Mathematics and Computation, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yirong Guo, Xia Zhang, Xinmiao Zhang 0006   +2 more
openaire   +2 more sources

Recent progress on strong edge-coloring of graphs

Discrete Mathematics, Algorithms and Applications, 2019
A 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, 2011
zbMATH 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, 2017
A 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