Abstract: A $k$-edge-coloring of a graph is an assignment of colors from a set of $k$ colors to the edges of $G$ such that adjacent edges receive distinct colors. $\chi'(G)$ denotes the smallest $k$ for which $G$ admits such a coloring. It is proved here that if a planar graph $G$ contains no $5$-fan $F_5$ as a subgraph, where $F_5$ is a graph of order $5$ with a vertex $v\in V(F_5)$ such that $d(v)=4$ and $F_5-v$ is a path, then $\chi'(G) \leq \max\{6, \Delta(G)\}$.

Key words: edge coloring, planar graph, cycle