  \textit{A star edge coloring} of a graph is a proper edge coloring without
bichromatic paths and cycles of length four. In this paper we establish tight
upper bounds for trees and subcubic outerplanar graphs, and derive an upper
bound for outerplanar graphs.
