Star edge coloring of some classes of graphs

Borut Lu\v{z}ar; Martina Mockov\v{c}iakov\'a; Riste \v{S}krekovski; Roman Sot\'ak; \v{L}udmila Bezegov\'a

arxiv: 1307.1242 · v1 · pith:UQ3DQNH2new · submitted 2013-07-04 · 🧮 math.CO

Star edge coloring of some classes of graphs

\v{L}udmila Bezegov\'a , Borut Lu\v{z}ar , Martina Mockov\v{c}iakov\'a , Roman Sot\'ak , Riste \v{S}krekovski This is my paper

classification 🧮 math.CO

keywords coloringedgegraphsouterplanarstarupperbichromaticbound

0 comments

read the original 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.

This paper has not been read by Pith yet.

Star edge coloring of some classes of graphs

discussion (0)