Abstract
A star edge coloring of a graph is a proper edge coloring of without bichromatic paths or cycles of length four. The it star chromatic index, of is the minimum number for which has a star edge coloring by colors. In \cite{LB}, L. Bezegov et al. conjectured that when is an outerplanar graph with maximum degree In this paper we obtained that when is an 2-connected outerplanar graph with diameter 2 or 3. If is an 2-connected outerplanar graph with maximum degree 5, then
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.