The Equitable Edge-coloring of Halin Graphs
Song Hui · Journal of Shandong University · 2003
An edge coloring of a graph G is equitable if, for each vertex v of G , the number of edges of any one color incident with v differs from the number of edges of any other color incident with v by at most one. It is proved that any Halin graph has an equitable edge coloring with k colors for any integer k 4. Some cases for k=3 are considered, too.