Answers are grounded in this paper and cite their sources.
This paper demonstrates that subcubic graphs with edge weight ≤ 6 achieve a strong list-chromatic index of at most 10, highlighting recent advancements in edge coloring.
A strong edge coloring of a graph G is an assignment of colors to the edges of G such that two distinct edges are colored differently if they are incident to a common edge or share an endpoint. The strong chromatic index of a graph G, denoted by χₛ'(G), is the minimum number of colors needed for a strong edge coloring of G. The edge weight of a graph G is defined to be maxuv∈ E(G)\(dG(u)+dG(v))\. It was proved in Chen et al in 2020 that every graph with edge weight at most 6 has a strong edge-coloring using at most 10 colors. In this paper, we consider the list version of strong edge-coloring. We strengthen this result by showing that every graph with edge weight at most 6 has a strong list-chromatic index at most 10. Specially, every subcubic graph has a strong list-chromatic index at most 10, which improves a result of Dai et al. in 2018.
No takes yet. Share an insight, caveat, or question.
Tang et al. (2025) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: