A strong edge-coloring of a graph G is a proper edge-coloring such that every color class induces a matching. In this paper, we discuss the strong chromatic index of a cycle on k vertices and use the result to calculate the strong chromatic index of (m,n)k-gon snake graphs which generalize the families of graphs referred to as the (m,n) triangle snake graphs and (m,n) quadrilateral snake graphs.

中文翻译：

---

广义多边形蛇图的强色指数

图G的强烈边缘着色是适当的边缘着色，以使每种颜色类别都可以引起匹配。在本文中，我们讨论了k个顶点上一个循环的强色度指数，并使用结果计算（m，n）k -gon蛇图的强色度指数，该图推广了称为（m， n）三角蛇形图和（m，n）四边形蛇形图。