In the report,a star edge-coloring of a graph G is a proper edge coloring without 2-colored paths or cy-cles of length 4.The star chromatic index of G,x'st(G),indicates that G has a star edge-coloring with the small-est number.The cactus graph is a connected graph of which each block is a cycle or an edge.The mathematical induction is performed to obtain a class of cactus graphs Cn·Cm(n ≥ 3,m≥3),and which are generalized.
cactus graphsstar edge-coloringstar chromatic index