Star Edge Coloring of Subcubic Graphs

Authors

Kavita Pradeep, Department of Mathematics, Anna University, MIT Campus, Chennai - 600044, IndiaFollow
V. Vijayalakshmi, Department of Mathematics, Anna University, MIT Campus, Chennai - 600044, IndiaFollow

Author Country (or Countries)

India

Abstract

A proper edge coloring of a graph G is called star edge coloring if there is no bi-colored path or cycle of length four in G. The minimum number of colors needed to star color the edges of G is called the star chromatic index of G, denoted by χs′(G). In 2013[1], Dvoˇr´ak et. al. proved that for a subcubic graph G, χs′ (G) ≤ 7 and conjectured that it is less than or equal to 6. In this paper, we show that if a subcubic graph G has maximum average degree less than 83 then χs′(G) ≤ 6.

Digital Object Identifier (DOI)

http://dx.doi.org/10.18576/amis/130216

Recommended Citation

Pradeep, Kavita and Vijayalakshmi, V. (2019) "Star Edge Coloring of Subcubic Graphs," Applied Mathematics & Information Sciences: Vol. 13: Iss. 2, Article 16.
DOI: http://dx.doi.org/10.18576/amis/130216
Available at: https://digitalcommons.aaru.edu.jo/amis/vol13/iss2/16