Star Edge Coloring of Some Classes of Graphs
L’udmila Bezegová, Borut Lužar, Martina Mockovčiaková, Roman Soták, Riste Škrekovski · Journal of Graph Theory · 2015
A star edge coloring of a graph is a proper edge coloring without bichromatic paths and cycles of length four. In this article, we establish tight upper bounds for trees and subcubic outerplanar graphs, and derive an upper bound for outerplanar graphs.