| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651538 | Electronic Notes in Discrete Mathematics | 2016 | 10 Pages |
Abstract
The star chromatic index of a graph G is the minimum number of colors needed to properly color the edges of G so that no path or cycle of length four is bi-colored. In this paper, we show that every subcubic graph with maximum average degree less than 115 can be star edge colored with at most five colors.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Kavita Pradeep, V Vijayalakshmi,