Star edge-coloring of some special graphs

Abstract

The star chromatic index of a multigraph $G$, denoted by ${\chi }_{\mathrm{star}}^{\prime }(G)$, is the minimum number of colors needed to properly color the edges of $G$ such that no path or cycle of length $4$ is bicolored. In this paper, we study the star edge-coloring of Halin graphs, $k$-power graphs and the generalized Petersen graphs $P(3n,n)$.

13 pages

Cited by in corpus (1)

• A survey on star edge-coloring of graphs