Results 221 to 230 of about 60,275 (251)

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

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 coloring algorithm for K4-minor free graphs

Discrete Mathematics, Algorithms and Applications
The strong chromatic index [Formula: see text] of a graph [Formula: see text] is the smallest integer [Formula: see text] such that [Formula: see text] has a proper edge [Formula: see text]-coloring with the condition that any two edges at distance at most 2 receive distinct colors.
M. F. van Bommel, Ping Wang
openaire   +1 more source

Security and Privacy on 6G Network Edge: A Survey

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

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

Resource Scheduling in Edge Computing: A Survey

IEEE Communications Surveys and Tutorials, 2021
Quyuan Luo, Shihong Hu, Changle Li
exaly