Star edge coloring of some classes of graphs

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.

Cited by in corpus (11)

• Resource requirements and speed versus geometry of unconditionally secure physical key exchanges
• Star 5-edge-colorings of subcubic multigraphs
• Note on list star edge-coloring of subcubic graphs
• Proper edge colorings of planar graphs with rainbow $C_4$-s
• On star edge colorings of bipartite and subcubic graphs
• A survey on star edge-coloring of graphs
• Star edge-coloring of some special graphs
• Nonrepetitive edge-colorings of trees
• Star Edge-Coloring of Square Grids
• Star Chromatic Index of Halin Graphs
• Star chromatic index of subcubic multigraphs