Star edge coloring of some classes of graphs
Combinatorics
2015-10-02 v1
Abstract
\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.
Keywords
Cite
@article{arxiv.1307.1242,
title = {Star edge coloring of some classes of graphs},
author = {Ľudmila Bezegová and Borut Lužar and Martina Mockovčiaková and Roman Soták and Riste Škrekovski},
journal= {arXiv preprint arXiv:1307.1242},
year = {2015}
}