A note on the strong edge-coloring of outerplanar graphs with maximum degree 3
发布时间：2025-04-30
点击次数：
- 发布时间：
- 2025-04-30
- 论文名称：
- A note on the strong edge-coloring of outerplanar graphs with maximum degree 3
- 发表刊物：
- Acta Math. Appl. Sin. Engl. Ser.
- 摘要：
- A strong k-edge-coloring of a graph G is an assignment of k colors to
the edges of G in such a way that any two edges meeting at a common
vertex, or being adjacent to the same edge of G, are assigned different
colors. The strong chromatic index of G is the smallest integer k for
which G has a strong k-edge-coloring. In this paper, we have shown
that the strong chromatic index is no larger than 6 for outerplanar
graphs with maximum degree 3.
- 合写作者：
- S. Liu, H. Zhang, H. Lu and Y. Lin
- 是否译文：
- 否
- 发表时间：
- 2016-12-28