Hui Lei, Yongtang Shi
Published 2020-09-17Version 1
The star chromatic index of a multigraph $G$, denoted $\chi'_{st}(G)$, is the minimum number of colors needed to properly color the edges of $G$ such that no path or cycle of length four is bicolored. We survey the results of determining the star chromatic index, present the interesting proofs and techniques, and collect many open problems and conjectures.
Comments: 24 pqges, 2 figures
On the excessive [m]-index of a tree
Cycle-saturated graphs with minimum number of edges
The leafage of a chordal graph
![QR code for arXiv:2009.08017 [math.CO]](http://oss.arxitics.com/images/favicon.svg)