Turkish Journal of Mathematics
Abstract
A star edge coloring of a graph $G$ is a proper edge coloring such that there is no bicolored path or cycle of length four. The minimum number of colors needed for a graph $G$ to admit a star edge coloring is called the star chromatic index and it is denoted by $\chi_s^{'}(G)$. In this paper, we consider graphs of maximum degree $\Delta \geq 4$ and show that if the maximum average degree of a graph is less than $\frac{14}{5}$ then $\chi_s^{'}(G) \leq 2\Delta + 1$.
DOI
10.3906/mat-1911-80
Keywords
Graph coloring, star edge coloring, star chromatic index, maximum average degree
First Page
54
Last Page
65
Recommended Citation
PRADEEP, K (2021). Star edge coloring of graphs with Mad($G$)$. Turkish Journal of Mathematics 45 (1): 54-65. https://doi.org/10.3906/mat-1911-80
