A note on the strong edge-coloring of outerplanar graphs with maximum degree 3
Release Time:2025-04-30
Hits:
- Date:
- 2025-04-30
- Title of Paper:
- A note on the strong edge-coloring of outerplanar graphs with maximum degree 3
- Journal:
- Acta Math. Appl. Sin. Engl. Ser.
- Summary:
- 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.
- Co-author:
- S. Liu, H. Zhang, H. Lu and Y. Lin
- Translation or Not:
- No
- Date of Publication:
- 2016-12-28