Results 121 to 130 of about 60,156 (132)

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

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

On (s, t)-relaxed strong edge-coloring of graphs

Journal of Combinatorial Optimization, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
He, Dan, Lin, Wensong
openaire   +2 more sources

Strong edge-coloring of $(3, ��)$-bipartite graphs

2014
A 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. Together with a
Bensmail, Julien, Lagoutte, Aur��lie, Valicov, Petru   +2 more
openaire   +1 more source

Adjacent strong edge colorings and total colorings of regular graphs

Science in China Series A: Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, ZhongFu, Woodall, Douglas R., Yao, Bing, Li, JingWen, Chen, XiangEn, Bian, Liang   +5 more
openaire   +1 more source

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   +3 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 Jennhwa Chang
openaire   +3 more sources

Strong Edge Coloring of Outerplane Graphs with Independent Crossings

Acta Mathematicae Applicatae Sinica, English Series
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Ke-Jie, Zhang, Xin
openaire   +2 more sources

Strong Edge Coloring of Subquartic Graphs

2023
Junlei Zhu, Hongguo Zhu
openaire   +1 more source

STRONG EDGE-COLORINGS OF POWERS OF PATHS AND CYCLES

Реберная раскраска φ графа G называется «сильной», если ребра, находящиеся на расстоянии не более 1, окрашены в различные цвета. Минимальное количество цветов, необходимое для сильной реберной раскраски графа G, называется «сильным хроматическим индексом» и обозначается через χs'(G). k-ая степень графа G имеет то же самое множество ребер, что и граф G,
A. Drambyan , P. Petrosyan
openaire   +1 more source