A note on a conjecture of star chromatic index for outerplanar graphs

Abstract

A star edge coloring of a graph G is a proper edge coloring of G without bichromatic paths or cycles of length four. The it star chromatic index, st' (G ), of G is the minimum number k for which G has a star edge coloring by k colors. In LB, L. Bezegova et al. conjectured that st' (G )≤ 32+1 when G is an outerplanar graph with maximum degree ≥ 3. In this paper we obtained that st'(G) ≤ +6 when G is an 2-connected outerplanar graph with diameter 2 or 3. If G is an 2-connected outerplanar graph with maximum degree 5, then st'(G) ≤ 9.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…