Star edge coloring of some classes of graphs

From MaRDI portal
Publication:3466355




Abstract: extit{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.




Cited in
(29)






This page was built for publication: Star edge coloring of some classes of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3466355)