Xuling Hou, Lingxi Li, Tao Wang
Published 2020-10-27Version 1
The star chromatic index of a multigraph $G$, denoted by $\chi_{\mathrm{star}}'(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)$.
A survey on star edge-coloring of graphs
On the odd girth and the circular chromatic number of generalized Petersen graphs
Star Edge-Coloring of Square Grids
![QR code for arXiv:2010.14349 [math.CO]](http://oss.arxitics.com/images/favicon.svg)